95 search results - page 17 / 19 » Optimal Information Gathering on the Internet with Time and ... |
IROS
2008
IEEE
14 years 4 days ago
2008
IEEE
— This paper presents a solution to the problem of steering a group of real omnidirectional mobile robots along a given path, while maintaining a desired formation pattern. This ...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
WWW
2010
ACM
14 years 22 days ago
2010
ACM
Web service composition enables seamless and dynamic integration of business applications on the web. The performance of the composed application is determined by the performance ...