Sciweavers

614 search results - page 58 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 4 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
AAAI
1994
14 years 11 months ago
Applying VC-Dimension Analysis To 3D Object Recognition from Perspective Projections
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
Michael Lindenbaum, Shai Ben-David
CORR
2006
Springer
138views Education» more  CORR 2006»
14 years 10 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
FOCS
2008
IEEE
15 years 4 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
MMS
1998
14 years 9 months ago
Packet Audio Playout Delay Adjustment: Performance Bounds and Algorithms
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
Sue B. Moon, James F. Kurose, Donald F. Towsley