Sciweavers

2754 search results - page 180 / 551
» Distributed Weighted Matching
Sort
View
PDPTA
2007
15 years 2 months ago
Brokering Algorithms for Composing Low Cost Distributed Storage Resources
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
Jimmy Secretan, Malachi Lawson, Ladislau Böl&...
113
Voted
ECCV
2008
Springer
16 years 2 months ago
Robust Visual Tracking Based on an Effective Appearance Model
Most existing appearance models for visual tracking usually construct a pixel-based representation of object appearance so that they are incapable of fully capturing both global an...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang
112
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
96
Voted
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
15 years 7 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
103
Voted
SIGIR
2005
ACM
15 years 6 months ago
Iterative translation disambiguation for cross-language information retrieval
Finding a proper distribution of translation probabilities is one of the most important factors impacting the effectiveness of a crosslanguage information retrieval system. In th...
Christof Monz, Bonnie J. Dorr