Sciweavers

766 search results - page 139 / 154
» Online Variance Minimization
Sort
View
TON
2012
11 years 9 months ago
Latency Equalization as a New Network Service Primitive
—Multiparty interactive network applications such as teleconferencing, network gaming, and online trading are gaining popularity. In addition to end-to-end latency bounds, these ...
Minlan Yu, Marina Thottan, Li (Erran) Li
ICCV
2007
IEEE
14 years 9 months ago
What Can Casual Walkers Tell Us About A 3D Scene?
An approach for incremental learning of a 3D scene from a single static video camera is presented in this paper. In particular, we exploit the presence of casual people walking in...
Diego Rother, Kedar A. Patwardhan, Guillermo Sapir...
ASIACRYPT
2009
Springer
14 years 2 months ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
SIGECOM
2005
ACM
120views ECommerce» more  SIGECOM 2005»
14 years 29 days ago
Optimal design of English auctions with discrete bid levels
In this paper we consider a common form of the English auction that is widely used in online Internet auctions. This discrete bid auction requires that the bidders may only submit...
Esther David, Alex Rogers, Jeremy Schiff, Sarit Kr...
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 29 days ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar