Sciweavers

2252 search results - page 182 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
121
Voted
SIGMETRICS
2008
ACM
15 years 3 months ago
Network distance estimation with dynamic landmark triangles
This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-di...
Zhihua Wen, Michael Rabinovich
124
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 3 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
129
Voted
WDAG
2010
Springer
206views Algorithms» more  WDAG 2010»
15 years 1 months ago
Scalable Quantum Consensus for Crash Failures
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
139
Voted
ICIP
2009
IEEE
15 years 1 months ago
Automatic scene relighting for video conferencing
This paper describes a new method to automatically improve scene lighting for video conferencing by learning the photometric mapping between a lower exposure and desired exposure ...
Stephen Mangiat, Jerry Gibson
GECCO
2009
Springer
138views Optimization» more  GECCO 2009»
15 years 10 months ago
Analysis of micro-behavior and bounded rationality in double auction markets using co-evolutionary GP
We investigate the dynamics of trader behaviors using a co-evolutionary genetic programming system to simulate a double-auction market. The objective of this study is twofold. Fir...
Shu-Heng Chen, Ren-Jie Zeng, Tina Yu