5595 search results - page 831 / 1119 » Approximation Algorithms for Clustering Problems |
213
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
187
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
182
click to vote
AROBOTS
2006
15 years 6 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
164
click to vote
FOCM
2007
15 years 6 months ago
2007
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
191
click to vote
SIGARCH
2008
15 years 6 months ago
2008
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...