Sciweavers

2593 search results - page 95 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
135
Voted
AUTOMATICA
2011
14 years 9 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
161
Voted
PLDI
2011
ACM
14 years 5 months ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
113
Voted
SWSTE
2005
IEEE
15 years 8 months ago
Mapping Structures for Flash Memories: Techniques and Open Problems
Flash memory is a type of electrically erasable programmable read-only memory (EEPROM). Because flash memories are nonvolatile and relatively dense, they are now used to store ...
Eran Gal, Sivan Toledo
111
Voted
DATAMINE
1999
113views more  DATAMINE 1999»
15 years 2 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
ICML
2007
IEEE
16 years 3 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen