Sciweavers

420 search results - page 66 / 84
» Volume in General Metric Spaces
Sort
View
78
Voted
CIKM
2009
Springer
15 years 2 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...
JAPLL
2008
121views more  JAPLL 2008»
14 years 9 months ago
Reasoning with prioritized information by iterative aggregation of distance functions
We introduce a general framework for reasoning with prioritized propositional data by aggregation of distance functions. Our formalism is based on a possible world semantics, wher...
Ofer Arieli
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 3 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici
EDBT
2009
ACM
134views Database» more  EDBT 2009»
15 years 1 months ago
Caching content-based queries for robust and efficient image retrieval
In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency iss...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
71
Voted
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...