4009 search results - page 753 / 802 » Clustering on Complex Graphs |
145
Voted
NAR
2011
14 years 6 months ago
2011
REPAIRtoire is the first comprehensive database resource for systems biology of DNA damage and repair. The database collects and organizes the following types of information: (i) ...
147
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
156
click to vote
AAMAS
2012
Springer
13 years 11 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
155
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
154
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...