Sciweavers

3049 search results - page 436 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 5 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
JAR
2007
142views more  JAR 2007»
15 years 4 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
TON
2010
99views more  TON 2010»
14 years 11 months ago
Rate Control With Pairwise Intersession Network Coding
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on rec...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 4 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
IPPS
2009
IEEE
15 years 11 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram