Sciweavers

646 search results - page 87 / 130
» Generalized connected domination in graphs
Sort
View
SIGCOMM
2009
ACM
14 years 3 months ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 8 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
CIKM
2005
Springer
14 years 2 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 8 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
SAT
2009
Springer
109views Hardware» more  SAT 2009»
14 years 3 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere