Sciweavers

6365 search results - page 212 / 1273
» Fast Local Computation Algorithms
Sort
View
DCOSS
2010
Springer
15 years 9 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
CLA
2004
15 years 7 months ago
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
Radim Belohlávek, Jiri Dvorak, Jan Outrata
ISVD
2010
IEEE
15 years 4 months ago
Fast Dynamic Voronoi Treemaps
—The Voronoi Treemap is a space-filling treemap technique that relaxes the constraints of rectangular nodes. Its organic shapes maintain a one-to-one aspect ratio, are flexible...
Avneesh Sud, Danyel Fisher, Huai-Ping Lee
132
Voted
JSC
2002
74views more  JSC 2002»
15 years 6 months ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
COLING
2002
15 years 6 months ago
A Cheap and Fast Way to Build Useful Translation Lexicons
The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative m...
Dan Tufis