Sciweavers

2004 search results - page 186 / 401
» Sampling from large graphs
Sort
View
NIPS
1997
15 years 7 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
DSN
2005
IEEE
16 years 1 days ago
ADEPTS: Adaptive Intrusion Response Using Attack Graphs in an E-Commerce Environment
Distributed systems with multiple interacting services, such as distributed e-commerce systems, are suitable targets for malicious attacks because of the potential financial impac...
Bingrui Foo, Yu-Sung Wu, Yu-Chun Mao, Saurabh Bagc...
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 8 months ago
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
Vineet Kahlon, Chao Wang
IJRR
2000
113views more  IJRR 2000»
15 years 6 months ago
Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot c...
Howie Choset, Joel W. Burdick
BIBE
2005
IEEE
154views Bioinformatics» more  BIBE 2005»
16 years 1 days ago
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur...