Sciweavers

774 search results - page 67 / 155
» A New Graph Triconnectivity Algorithm and Its Parallelizatio...
Sort
View
ALGOSENSORS
2006
Springer
14 years 25 days ago
A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
Sandip Roy, Yan Wan, Ali Saberi
PODC
2004
ACM
14 years 2 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
IWPEC
2009
Springer
14 years 3 months ago
Improved Induced Matchings in Sparse Graphs
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Wal...
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 3 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
SIGMOD
2002
ACM
91views Database» more  SIGMOD 2002»
14 years 9 months ago
A scalable hash ripple join algorithm
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...
Gang Luo, Curt J. Ellmann, Peter J. Haas, Jeffrey ...