Sciweavers

1933 search results - page 311 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 9 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
FOCS
2006
IEEE
14 years 3 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 9 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 3 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
IVC
2007
187views more  IVC 2007»
13 years 8 months ago
Non-rigid structure from motion using ranklet-based tracking and non-linear optimization
In this paper, we address the problem of estimating the 3D structure and motion of a deformable object given a set of image features tracked automatically throughout a video seque...
Alessio Del Bue, Fabrizio Smeraldi, Lourdes de Aga...