Sciweavers

187 search results - page 23 / 38
» Generic Graph Algorithms for Sparse Matrix Ordering
Sort
View
71
Voted
SIAMJO
2010
87views more  SIAMJO 2010»
14 years 4 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
JPDC
1998
124views more  JPDC 1998»
14 years 9 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
68
Voted
DEXA
2006
Springer
80views Database» more  DEXA 2006»
15 years 1 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
CORR
2007
Springer
144views Education» more  CORR 2007»
14 years 9 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 9 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj