1101 search results - page 163 / 221 » An Algorithm for the Graph Crossing Number Problem |
149
Voted
STACS
1992
Springer
15 years 6 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
143
Voted
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
153
click to vote
IEEEMSP
2002
IEEE
15 years 7 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
132
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
132
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...