Sciweavers

796 search results - page 108 / 160
» The Anonymous Subgraph Problem
Sort
View
PKDD
2010
Springer
127views Data Mining» more  PKDD 2010»
14 years 9 months ago
Software-Defect Localisation by Mining Dataflow-Enabled Call Graphs
Defect localisation is essential in software engineering and is an important task in domain-specific data mining. Existing techniques building on call-graph mining can localise dif...
Frank Eichinger, Klaus Krogmann, Roland Klug, Klem...
JGT
2010
109views more  JGT 2010»
14 years 6 months ago
Homomorphism-homogeneous graphs
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
Momchil Rusinov, Pascal Schweitzer
INFOCOM
2012
IEEE
13 years 2 months ago
Sparse recovery with graph constraints: Fundamental limits and measurement construction
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
Meng Wang, Weiyu Xu, Enrique Mallada, Ao Tang
110
Voted
TWC
2010
14 years 6 months ago
Lifetime-resource tradeoff for multicast traffic in wireless sensor networks
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
Vahid Shah-Mansouri, Vincent W. S. Wong
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
16 years 13 days ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi