Sciweavers

13603 search results - page 353 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
ACL
1993
15 years 8 months ago
Principle-Based Parsing without Overgeneration
Overgeneration is the main source of computational complexity in previous principle-based parsers. This paper presents a message passing algorithm for principle-based parsing that...
Dekang Lin
APAL
2006
94views more  APAL 2006»
15 years 7 months ago
Parameterized counting problems
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
Catherine McCartin
IJNSEC
2008
128views more  IJNSEC 2008»
15 years 7 months ago
Attacking LCCC Batch Verification of RSA Signatures
Batch verification of digital signatures is used to improve the computational complexity when a large number of digital signatures must be verified. Lee at al. [2] proposed a new ...
Martin Stanek
DAM
2007
77views more  DAM 2007»
15 years 7 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
JRTIP
2006
119views more  JRTIP 2006»
15 years 7 months ago
Achieving real-time object detection and tracking under extreme conditions
In this survey, we present a brief analysis of single camera object detection and tracking methods. We also give a comparison of their computational complexities. These methods ar...
Fatih Porikli