Sciweavers

2219 search results - page 144 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
166
Voted
CP
2003
Springer
15 years 7 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
ICDAR
2003
IEEE
15 years 7 months ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton
134
Voted
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
15 years 8 months ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
129
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 2 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
136
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
Debugging reinvented: asking and answering why and why not questions about program behavior
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...
Andrew Jensen Ko, Brad A. Myers