10988 search results - page 1783 / 2198 » Algorithmic Folding Complexity |
123
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generati...
248
click to vote
PODS
2009
ACM
16 years 5 months ago
2009
ACM
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
241
click to vote
PODS
2009
ACM
16 years 5 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
118
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
155
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...