618 search results - page 87 / 124 » The shifting sands algorithm |
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
100
click to vote
CIKM
1993
Springer
15 years 1 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
100
click to vote
BMCBI
2011
2011
Smith-Waterman Peak Alignment for Comprehensive Two-dimensional Gas Chromatography Mass Spectrometry
14 years 1 months ago
Background: Comprehensive two-dimensional gas chromatography coupled with mass spectrometry (GC × GCMS) is a powerful technique which has gained increasing attention over the las...
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We present an unsupervised method for learning a hierarchy of sparse feature detectors that are invariant to small shifts and distortions. The resulting feature extractor consists...