Sciweavers

4009 search results - page 580 / 802
» Clustering on Complex Graphs
Sort
View
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 4 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
WINET
2010
128views more  WINET 2010»
15 years 4 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
COLT
2010
Springer
15 years 4 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
FAST
2009
15 years 4 months ago
Story Book: An Efficient Extensible Provenance Framework
Most application provenance systems are hard coded for a particular type of system or data, while current provenance file systems maintain in-memory provenance graphs and reside i...
Richard P. Spillane, Russell Sears, Chaitanya Yala...
ICSE
2009
IEEE-ACM
15 years 4 months ago
A model for dynamic and adaptable services management
The dynamic nature of Service-Oriented Architectures challenges traditional systems management practices which tend to be static in nature. We propose a goal-oriented, agent-based...
Patrick Martin, Wendy Powley, Imad Abdallah, Jun L...