1552 search results - page 227 / 311 » On the Complexity of Constant Propagation |
315
click to vote
STOC
2003
ACM
16 years 6 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...
164
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
166
click to vote
MOBIHOC
2006
ACM
16 years 6 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...
166
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
176
click to vote
Publication
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...