154 search results - page 18 / 31 » Algorithms for Implicit Hitting Set Problems |
ICIAP
1997
ACM
15 years 3 months ago
1997
ACM
A strategy in solving the shape from shading problem for the shape and albedo recovery of book surfaces under the fully perspective environment is proposed. The whole recovery proc...
131
click to vote
NIPS
2001
15 years 1 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
115
click to vote
JMLR
2008
14 years 11 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
114
click to vote
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...