Sciweavers

4565 search results - page 460 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
PODS
2009
ACM
112views Database» more  PODS 2009»
16 years 5 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
ICRA
2008
IEEE
160views Robotics» more  ICRA 2008»
15 years 11 months ago
A constrained optimization approach to virtual fixtures for multi-handed tasks
— In this work, we have extended the concept of constrained motion control of robots to surgical tasks that require multiple robots. We present virtual fixtures to guide the mot...
Ankur Kapoor, Russell H. Taylor
JMLR
2010
165views more  JMLR 2010»
14 years 11 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 4 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 1 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu