Sciweavers

1632 search results - page 194 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
JAIR
2010
94views more  JAIR 2010»
15 years 2 months ago
Which Clustering Do You Want? Inducing Your Ideal Clustering with Minimal Feedback
While traditional research on text clustering has largely focused on grouping documents by topic, it is conceivable that a user may want to cluster documents along other dimension...
Sajib Dasgupta, Vincent Ng
CAD
2006
Springer
15 years 4 months ago
Region-expansion for the Voronoi diagram of 3D spheres
Given a set of spheres in 3D, constructing its Voronoi diagram in Euclidean distance metric is not easy at all even though many mathematical properties of its structure are known....
Donguk Kim, Deok-Soo Kim
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 10 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
EDBT
2009
ACM
134views Database» more  EDBT 2009»
15 years 8 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...
CP
2000
Springer
15 years 8 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa