5105 search results - page 59 / 1021 » Approximate Structural Consistency |
AI
2008
Springer
14 years 12 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
126
click to vote
TON
2010
14 years 6 months ago
2010
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
119
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...