Sciweavers

102 search results - page 20 / 21
» VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Sort
View
KAIS
2006
110views more  KAIS 2006»
13 years 5 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
GIS
2008
ACM
14 years 6 months ago
Parallel ODETLAP for terrain compression and reconstruction
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Ran...
IPPS
2008
IEEE
13 years 12 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
ICDCS
2006
IEEE
13 years 11 months ago
Stable and Accurate Network Coordinates
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...
Jonathan Ledlie, Peter R. Pietzuch, Margo I. Seltz...
FOCS
2002
IEEE
13 years 10 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg