Sciweavers

96 search results - page 17 / 20
» Approximating the maximum quadratic assignment problem
Sort
View
ACID
2006
239views Algorithms» more  ACID 2006»
13 years 11 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
NIPS
2007
13 years 11 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
EOR
2008
78views more  EOR 2008»
13 years 9 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
PAMI
2008
132views more  PAMI 2008»
13 years 9 months ago
Trajectory Association across Multiple Airborne Cameras
A camera mounted on an aerial vehicle provides an excellent means to monitor large areas of a scene. Utilizing several such cameras on different aerial vehicles allows further flex...
Yaser Sheikh, Mubarak Shah