Sciweavers

1647 search results - page 132 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 9 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
ANOR
2007
80views more  ANOR 2007»
15 years 5 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
PAMI
2008
270views more  PAMI 2008»
15 years 4 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 10 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
JCSS
2008
80views more  JCSS 2008»
15 years 5 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...