3333 search results - page 278 / 667 » Abstract Proof Search |
225
click to vote
MMM
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
178
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
186
click to vote
JAR
2000
15 years 6 months ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
167
click to vote
TCC
2007
Springer
16 years 23 days ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
171
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...