558 search results - page 75 / 112 » Trees and Matchings |
158
Voted
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
189
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
169
click to vote
CSB
2002
IEEE
15 years 11 months ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
185
Voted
PODS
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
134
Voted
COCOON
2007
Springer
16 years 8 days ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...