4860 search results - page 599 / 972 » SNPs Problems, Complexity, and Algorithms |
126
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...
136
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
158
Voted
FASE
2010
Springer
15 years 12 months ago
2010
Springer
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
138
click to vote
TACAS
2009
Springer
15 years 12 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
147
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...