4865 search results - page 770 / 973 » The Complexity of Graph Connectivity |
152
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
152
click to vote
SISAP
2009
IEEE
15 years 11 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 ...
140
click to vote
BICOB
2009
Springer
15 years 10 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...
154
Voted
GECCO
2007
Springer
15 years 10 months 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...
136
Voted
PODC
2005
ACM
15 years 9 months 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...