Sciweavers

5595 search results - page 427 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 8 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
15 years 7 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
CORR
2010
Springer
133views Education» more  CORR 2010»
15 years 7 months ago
Santa Claus Schedules Jobs on Unrelated Machines
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
Ola Svensson
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 7 months ago
Principal Graphs and Manifolds
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
Alexander N. Gorban, Andrei Yu. Zinovyev