Sciweavers

405 search results - page 79 / 81
» Approximation properties of the Generalized Finite Element M...
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 7 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
DIMACS
1996
13 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
CVPR
2007
IEEE
14 years 9 months ago
Differential Camera Tracking through Linearizing the Local Appearance Manifold
The appearance of a scene is a function of the scene contents, the lighting, and the camera pose. A set of n-pixel images of a non-degenerate scene captured from different perspec...
Hua Yang, Marc Pollefeys, Greg Welch, Jan-Michael ...
IMC
2009
ACM
14 years 2 months ago
Sampling biases in network path measurements and what to do about it
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
Srikanth Kandula, Ratul Mahajan