608 search results - page 30 / 122 » On Dependent Randomized Rounding Algorithms |
125
Voted
PVLDB
2010
15 years 1 months ago
2010
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...
136
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
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...
110
Voted
FPL
2006
Springer
15 years 6 months ago
2006
Springer
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...
149
Voted
COLT
1998
Springer
15 years 6 months ago
1998
Springer
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...
125
click to vote
IFIP
2003
Springer
15 years 7 months ago
2003
Springer
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...