Sciweavers

4074 search results - page 260 / 815
» Abstract Graph Transformation
Sort
View
DCOSS
2010
Springer
15 years 10 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
ER
2008
Springer
140views Database» more  ER 2008»
15 years 8 months ago
Design Metrics for Data Warehouse Evolution
During data warehouse design, the designer frequently encounters the problem of choosing among different alternatives for the same design construct. The behavior of the chosen desi...
George Papastefanatos, Panos Vassiliadis, Alkis Si...
AAAI
2004
15 years 8 months ago
A Correspondence Metric for Imitation
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...
R. Amit, Maja J. Mataric
CPC
2006
110views more  CPC 2006»
15 years 6 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
CORR
2007
Springer
87views Education» more  CORR 2007»
15 years 6 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami