Sciweavers

1480 search results - page 86 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
NIPS
2008
13 years 12 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
TSP
2010
13 years 5 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 10 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
ISBI
2009
IEEE
14 years 5 months ago
Improving M/EEG Source Localization with an Inter-Condition Sparse Prior
The inverse problem with distributed dipoles models in M/EEG is strongly ill-posed requiring to set priors on the solution. Most common priors are based on a convenient ℓ2 norm....
Alexandre Gramfort, Matthieu Kowalski
PODC
2010
ACM
14 years 10 days ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer