Sciweavers

1095 search results - page 117 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
131
Voted
DCOSS
2007
Springer
15 years 9 months ago
Design and Implementation of a Flexible Location Directory Service for Tiered Sensor Networks
Many emergent distributed sensing applications need to keep track of mobile entities across multiple sensor networks connected via an IP network. To simplify the realization of suc...
Sangeeta Bhattacharya, Chien-Liang Fok, Chenyang L...
157
Voted
CONCUR
2003
Springer
15 years 8 months ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
CVPR
2011
IEEE
15 years 10 days ago
Distributed Message Passing for Large Scale Graphical Models
In this paper we propose a distributed message-passing algorithm for inference in large scale graphical models. Our method can handle large problems efficiently by distributing a...
Alexander Schwing, Hazan Tamir, Marc Pollefeys, Ra...
146
Voted
CCGRID
2010
IEEE
15 years 3 months ago
High Performance Dimension Reduction and Visualization for Large High-Dimensional Data Analysis
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
Jong Youl Choi, Seung-Hee Bae, Xiaohong Qiu, Geoff...
186
Voted
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 9 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...