Sciweavers

150 search results - page 20 / 30
» A Linear Algorithm for Computing the Homography from Conics ...
Sort
View
NIPS
2001
13 years 10 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
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...
Pascal Vincent, Yoshua Bengio
EWSN
2004
Springer
14 years 2 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
ECCV
2010
Springer
14 years 1 months ago
Fast Covariance Computation and Dimensionality Reduction for Sub-Window Features in Images
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
RECOMB
1997
Springer
14 years 22 days ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
ICCV
2009
IEEE
15 years 1 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey