4114 search results - page 400 / 823 » Efficient Algorithms for the 2-Center Problems |
187
click to vote
LKR
2008
15 years 8 months ago
2008
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...
161
click to vote
NIPS
2008
15 years 8 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
198
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
161
click to vote
IJFCS
2006
15 years 6 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
192
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...