Sciweavers

291 search results - page 34 / 59
» How Well Can Primal-Dual and Local-Ratio Algorithms Perform
Sort
View
PCM
2005
Springer
288views Multimedia» more  PCM 2005»
15 years 7 months ago
Adaptive Deinterlacing for Real-Time Applications
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
Qian Huang, Wen Gao, Debin Zhao, Huifang Sun
INFOCOM
2009
IEEE
15 years 8 months ago
Encounter-Based Routing in DTNs
—Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network...
Samuel C. Nelson, Mehedi Bakht, Robin Kravets
IPPS
2006
IEEE
15 years 7 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 7 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
AAAI
1998
15 years 2 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans