Sciweavers

1461 search results - page 250 / 293
» Complexity of Graph Covering Problems
Sort
View
PDP
2002
IEEE
14 years 1 months ago
The CDAG: A Data Structure for Automatic Parallelization for a Multithreaded Architecture
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
Bernd Klauer, Frank Eschmann, Ronald Moore, Klaus ...
CISS
2008
IEEE
13 years 9 months ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
ICASSP
2011
IEEE
13 years 15 days ago
Sparse graphical modeling of piecewise-stationary time series
Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary mul...
Daniele Angelosante, Georgios B. Giannakis
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 11 months ago
Robust Reputation-Based Ranking on Bipartite Rating Networks
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, Hong Cheng
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer