Sciweavers

17951 search results - page 3509 / 3591
» Network Coding Applications
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
15 years 10 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
OSDI
2008
ACM
15 years 10 months ago
Carnegie Mellon's CyDAT: Harnessing a Wide Array of Telemetry Data to Enhance Distributed System Diagnostics
The number and complexity of distributed applications has exploded, and to-date, each has had to create its own method for providing diagnostic tools and performance metrics. Thes...
Chas DiFatta, Mark Poepping, Daniel V. Klein
VLDB
2004
ACM
112views Database» more  VLDB 2004»
15 years 10 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 10 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
« Prev « First page 3509 / 3591 Last » Next »