Sciweavers

440 search results - page 57 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
WWW
2006
ACM
14 years 8 months ago
Mining search engine query logs for query recommendation
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial-strength search engine. In orde...
Zhiyong Zhang, Olfa Nasraoui
TVCG
2011
188views more  TVCG 2011»
13 years 3 months ago
Data-Parallel Octrees for Surface Reconstruction
—We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds...
Kun Zhou, Minmin Gong, Xin Huang, Baining Guo
CGF
2010
157views more  CGF 2010»
13 years 5 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
ACCV
2007
Springer
14 years 2 months ago
Fast Optimal Three View Triangulation
We consider the problem of L2-optimal triangulation from three separate views. Triangulation is an important part of numerous computer vision systems. Under gaussian noise, minimiz...
Martin Byröd, Klas Josephson, Kalle Åst...