Sciweavers

1578 search results - page 280 / 316
» Algorithmic randomness of continuous functions
Sort
View
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 8 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
AROBOTS
2002
98views more  AROBOTS 2002»
13 years 8 months ago
Dynamically-Stable Motion Planning for Humanoid Robots
We present an approach to path planning for humanoid robots that computes dynamically-stable, collision-free trajectories from full-body posture goals. Given a geometric model of t...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
ICWS
2010
IEEE
13 years 6 months ago
An Approach for Mining Web Service Composition Patterns from Execution Logs
A service-oriented application is composed of multiple web services to fulfill complex functionality that cannot be provided by individual web service. The combination of services ...
Ran Tang, Ying Zou
FOCS
2009
IEEE
13 years 6 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
CVPR
2011
IEEE
13 years 4 months ago
A Global Sampling Method for Alpha Matting
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
Kaiming He, Christoph Rhemann, Carsten Rother, Xia...