157 search results - page 13 / 32 » A Simple Algorithm for Finding Exact Common Repeats |
ALGORITHMICA
2005
14 years 9 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
45
Voted
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal...
81
Voted
SIROCCO
2010
14 years 11 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
JCC
2006
14 years 9 months ago
2006
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
121
click to vote
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...