Sciweavers

725 search results - page 98 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
FSTTCS
2010
Springer
14 years 7 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
SIP
2001
14 years 11 months ago
Marching ridges
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measureme...
Jacob D. Furst, Stephen M. Pizer
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
15 years 9 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
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
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
15 years 4 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala