Sciweavers

41 search results - page 2 / 9
» Vertex Sparsifiers: New Results from Old Techniques
Sort
View
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
13 years 12 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
VLDB
2003
ACM
113views Database» more  VLDB 2003»
14 years 5 months ago
PSoup: a system for streaming queries over streaming data
Recent work on querying data streams has focused on systems where newly arriving data is processed and continuously streamed to the user in real time. In many emerging applications...
Sirish Chandrasekaran, Michael J. Franklin
JAL
2006
114views more  JAL 2006»
13 years 5 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
FOCS
2005
IEEE
13 years 11 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ECOOP
2004
Springer
13 years 9 months ago
Early Identification of Incompatibilities in Multi-component Upgrades
Previous work proposed a technique for predicting problems resulting from replacing one version of a software component by another. The technique reports, before performing the rep...
Stephen McCamant, Michael D. Ernst