7129 search results - page 1160 / 1426 » Approximation Algorithms for Treewidth |
113
click to vote
VLDB
2001
ACM
15 years 7 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
184
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
117
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
147
Voted
STOC
2000
ACM
15 years 7 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
136
click to vote
CIAC
2000
Springer
15 years 7 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...