688 search results - page 101 / 138 » General Partitioning on Random Graphs |
120
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
128
Voted
SWAT
2010
Springer
15 years 5 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
104
Voted
KDD
2004
ACM
16 years 27 days ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
94
Voted
HT
2009
ACM
15 years 7 months ago
2009
ACM
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
128
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...