2219 search results - page 398 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
129
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
139
Voted
ICIP
2001
IEEE
16 years 3 months ago
2001
IEEE
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
97
Voted
RECOMB
2003
Springer
16 years 2 months ago
2003
Springer
The correct interpretation of tandem mass spectra is a difficult problem, even when it is limited to scoring peptides against a database. De novo sequencing is considerably harder...
122
click to vote
DAC
1994
ACM
15 years 6 months ago
1994
ACM
- This paper studies the routing problem for a new Field-Programmable Gate Array (FPGA) and Field-Programmable Interconnect Chip (FPIC) routing architecture which improves upon the...
101
click to vote
COR
2007
15 years 2 months ago
2007
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...