2252 search results - page 282 / 451 » Lower Bounds for Dynamic Algorithms |
139
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
110
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
123
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
151
Voted
RANDOM
1998
Springer
15 years 7 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
192
click to vote
ISSAC
1997
Springer
15 years 7 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...