4009 search results - page 571 / 802 » Clustering on Complex Graphs |
166
click to vote
ISSTA
2009
ACM
16 years 1 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
130
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
164
click to vote
ICDM
2007
IEEE
16 years 27 days ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
151
click to vote
ATVA
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
203
click to vote
ICDT
2007
ACM
16 years 22 days ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...