Sciweavers

1802 search results - page 17 / 361
» Sparse Computations with PEI
Sort
View
CISS
2008
IEEE
14 years 1 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
AAAI
2007
13 years 9 months ago
A Mathematical Programming Formulation for Sparse Collaborative Computer Aided Diagnosis
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
Jinbo Bi, Tao Xiong
JPDC
2006
134views more  JPDC 2006»
13 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
WAW
2004
Springer
124views Algorithms» more  WAW 2004»
14 years 2 days ago
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)
ystem (Extended Abstract) Gianna M. Del Corso1 Antonio Gull´ı1,2 Francesco Romani1 1 Dipartimento di Informatica, University of Pisa, Italy 2 IIT-CNR, Pisa
Gianna M. Del Corso, Antonio Gulli, Francesco Roma...
SIGMOD
1999
ACM
157views Database» more  SIGMOD 1999»
13 years 11 months ago
Bottom-Up Computation of Sparse and Iceberg CUBEs
Kevin S. Beyer, Raghu Ramakrishnan