Sciweavers

1090 search results - page 107 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
IDEAS
2002
IEEE
113views Database» more  IDEAS 2002»
14 years 2 months ago
Scalable QoS-Aware Disk-Scheduling
A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as re...
Walid G. Aref, Khaled El-Bassyouni, Ibrahim Kamel,...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 9 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CVPR
2012
IEEE
12 years 3 months ago
Branch-and-price global optimization for multi-view multi-object tracking
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
Laura Leal-Taixe, Gerard Pons-Moll, Bodo Rosenhahn
TIP
2010
155views more  TIP 2010»
13 years 7 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He