Sciweavers

557 search results - page 69 / 112
» On the convergence time of distributed quantized averaging a...
Sort
View
ICIAP
2005
ACM
14 years 7 months ago
3D Surface Reconstruction from Scattered Data Using Moving Least Square Method
This paper presents an efficient implementation of moving least square(MLS) approximation for 3D surface reconstruction. The smoothness of the MLS is mainly determined by the weigh...
Soon-Jeong Ahn, Jaechil Yoo, Byung-Gook Lee, Joon-...
JMLR
2010
184views more  JMLR 2010»
13 years 2 months ago
Sequential Monte Carlo Samplers for Dirichlet Process Mixtures
In this paper, we develop a novel online algorithm based on the Sequential Monte Carlo (SMC) samplers framework for posterior inference in Dirichlet Process Mixtures (DPM) (DelMor...
Yener Ülker, Bilge Günsel, Ali Taylan Ce...
CORR
2011
Springer
213views Education» more  CORR 2011»
13 years 2 months ago
Adapting to Non-stationarity with Growing Expert Ensembles
Forecasting sequences by expert ensembles generally assumes stationary or near-stationary processes; however, in complex systems and many real-world applications, we are frequentl...
Cosma Rohilla Shalizi, Abigail Z. Jacobs, Aaron Cl...
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
14 years 1 months ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch
FOCS
1994
IEEE
13 years 12 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim