6315 search results - page 105 / 1263 » Approximating Solution Structure |
CBMS
2007
IEEE
15 years 9 months ago
2007
IEEE
Proposing a treatment to patients is one of the physicians’ most common tasks. There are different elements that influence the decision of a physician to propose an appropriate ...
176
click to vote
STOC
1998
ACM
15 years 7 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
146
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
117
click to vote
AI
2008
Springer
15 years 3 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...
154
click to vote
TON
2010
14 years 9 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 ...