Sciweavers

5169 search results - page 438 / 1034
» Locality approximation using time
Sort
View
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 8 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
JACM
2012
13 years 10 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SASO
2007
IEEE
16 years 1 months ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
ACCV
2006
Springer
16 years 1 months ago
Fast Image Replacement Using Multi-resolution Approach
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing...
Chih-Wei Fang, James Jenn-Jier Lien
NIPS
2008
15 years 9 months ago
Using Bayesian Dynamical Systems for Motion Template Libraries
Motor primitives or motion templates have become an important concept for both modeling human motor control as well as generating robot behaviors using imitation learning. Recent ...
Silvia Chiappa, Jens Kober, Jan Peters