Sciweavers

4114 search results - page 175 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 6 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CBMS
2006
IEEE
16 years 16 days ago
Efficient Rotation Invariant Retrieval of Shapes with Applications in Medical Databases
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...
Selina Chu, Shrikanth S. Narayanan, C. C. Jay Kuo
DIS
2007
Springer
15 years 10 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
CVPR
2004
IEEE
16 years 8 months ago
The SPS Algorithm: Patching Figural Continuity and Transparency by Split-Patch Search
This paper describes a novel algorithm for the efficient synthesis of high-quality virtual views from only two input images. The emphasis is on the recovery of continuity of objec...
Antonio Criminisi, Andrew Blake
ICML
2007
IEEE
16 years 7 months ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi