Sciweavers

17770 search results - page 3074 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
178
Voted
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 6 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
16 years 6 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
16 years 6 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
VLDB
2007
ACM
104views Database» more  VLDB 2007»
16 years 6 months ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma
« Prev « First page 3074 / 3554 Last » Next »