688 search results - page 96 / 138 » General Partitioning on Random Graphs |
93
Voted
WWW
2003
ACM
16 years 1 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
96
Voted
KBS
2007
15 years 11 days ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
125
click to vote
MM
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
104
click to vote
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...