1389 search results - page 140 / 278 » Improved Approximation Algorithms for Label Cover Problems |
124
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
128
click to vote
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
123
Voted
CORR
2000
Springer
15 years 3 months ago
2000
Springer
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...
172
click to vote
JMLR
2012
13 years 5 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
151
click to vote
DASFAA
2003
IEEE
15 years 8 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...