Sciweavers

3874 search results - page 155 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
118
Voted
JAT
2010
71views more  JAT 2010»
15 years 1 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes
144
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 4 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
125
Voted
LICS
2009
IEEE
15 years 10 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson
135
Voted
CCCG
1998
15 years 4 months ago
Quantile approximation for robust statistical estimation
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
David M. Mount, Nathan S. Netanyahu, Christine D. ...
115
Voted
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
15 years 9 months ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...