1920 search results - page 338 / 384 » The Complexity of the A B C Problem |
145
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
169
click to vote
COMPGEOM
2009
ACM
16 years 11 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
197
click to vote
IPSN
2007
Springer
16 years 46 min ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
192
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
147
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...