Sciweavers

1024 search results - page 13 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
AIPS
1994
14 years 11 months ago
Design Tradeoffs in Partial Order (Plan space) Planning
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
Subbarao Kambhampati
77
Voted
CORR
2010
Springer
167views Education» more  CORR 2010»
14 years 9 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...
69
Voted
NPL
2002
103views more  NPL 2002»
14 years 9 months ago
Kernel Nearest Neighbor Algorithm
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...
Kai Yu, Liang Ji, Xuegong Zhang
IANDC
2008
101views more  IANDC 2008»
14 years 9 months ago
Trees with exponentially growing costs
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
Frank Schulz
81
Voted
CVPR
2008
IEEE
15 years 4 months ago
A linear approach to motion estimation using generalized camera models
A well-known theoretical result for motion estimation using the generalized camera model is that 17 corresponding image rays can be used to solve linearly for the motion of a gene...
Hongdong Li, Richard I. Hartley, Jae-Hak Kim