5595 search results - page 216 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
153
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
173
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
195
click to vote
APWEB
2004
Springer
15 years 11 months ago
2004
Springer
Today, search engine is the most commonly used tool for Web information retrieval, however, its current status is still far from satisfaction. This paper focuses on clustering Web...
173
click to vote
CLUSTER
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...