5100 search results - page 766 / 1020 » The Linear Complexity of a Graph |
188
click to vote
SISAP
2009
IEEE
16 years 1 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
171
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
203
click to vote
GECCO
2007
Springer
16 years 21 days ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
181
click to vote
PODC
2005
ACM
16 years 2 days ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
229
click to vote
WOSP
1998
ACM
15 years 10 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...