Sciweavers

608 search results - page 30 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
PVLDB
2010
120views more  PVLDB 2010»
13 years 7 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab
PODC
2010
ACM
14 years 20 days ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
FPL
2006
Springer
124views Hardware» more  FPL 2006»
14 years 13 days ago
A Dynamically Reconfigurable Queue Scheduler
In this paper we present the design and implementation of a dynamically reconfigurable system for packet queue scheduling. Two widely accepted queue schedulers have been implement...
Christoforos Kachris, Stamatis Vassiliadis
COLT
1998
Springer
14 years 1 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
IFIP
2003
Springer
14 years 2 months ago
Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...
Gil Zussman, Uri Yechiali, Adrian Segall