Sciweavers

324 search results - page 29 / 65
» Distance Approximating Trees: Complexity and Algorithms
Sort
View
GIS
2005
ACM
14 years 8 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 29 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 7 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
ICML
2008
IEEE
14 years 8 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
NIPS
2007
13 years 8 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch