1331 search results - page 192 / 267 » Complexity bounds for zero-test algorithms |
257
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
127
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
126
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
114
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
188
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...