Sciweavers

80 search results - page 15 / 16
» Biped Gait Optimization using Spline Function based Probabil...
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 5 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
SECON
2007
IEEE
13 years 11 months ago
Fairness and Physical Layer Capture in Random Access Networks
Abstract— While physical layer capture has been observed in real implementations of wireless devices which randomly accessing shared channels, fair rate control algorithms based ...
Hoon Chang, Vishal Misra, Dan Rubenstein
TIT
1998
112views more  TIT 1998»
13 years 5 months ago
Application of Network Calculus to Guaranteed Service Networks
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
Jean-Yves Le Boudec
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 5 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 9 days ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...