Sciweavers

1632 search results - page 164 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
IWPEC
2010
Springer
15 years 2 months ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij
116
Voted
PAMI
2008
208views more  PAMI 2008»
15 years 4 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
COMPLIFE
2006
Springer
15 years 7 months ago
Adaptive Approach for Modelling Variability in Pharmacokinetics
Abstract. We present an improved adaptive approach for studying systems of ODEs affected by parameter variability and state space uncertainty. Our approach is based on a reformulat...
Andrea Y. Weiße, Illia Horenko, Wilhelm Huis...
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 9 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
CIKM
2008
Springer
15 years 6 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand