2137 search results - page 221 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
180
click to vote
SIROCCO
2008
15 years 7 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
196
click to vote
SIAMJO
2002
15 years 6 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
143
Voted
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
173
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
190
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...