Sciweavers

289 search results - page 38 / 58
» Node similarity in the citation graph
Sort
View
MOBIHOC
2002
ACM
14 years 7 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
KDD
2012
ACM
229views Data Mining» more  KDD 2012»
11 years 10 months ago
Finding trendsetters in information networks
Influential people have an important role in the process of information diffusion. However, there are several ways to be influential, for example, to be the most popular or the...
Diego Sáez-Trumper, Giovanni Comarela, Virg...
SOFTVIS
2010
ACM
13 years 7 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
WSDM
2012
ACM
325views Data Mining» more  WSDM 2012»
12 years 3 months ago
Correlating financial time series with micro-blogging activity
We study the problem of correlating micro-blogging activity with stock-market events, defined as changes in the price and traded volume of stocks. Specifically, we collect messa...
Eduardo J. Ruiz, Vagelis Hristidis, Carlos Castill...
CAV
2006
Springer
121views Hardware» more  CAV 2006»
13 years 11 months ago
Deriving Small Unsatisfiable Cores with Dominators
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
Roman Gershman, Maya Koifman, Ofer Strichman