562 search results - page 96 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
69
Voted
STOC
2005
ACM
15 years 10 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
CSL
2010
Springer
14 years 9 months ago
2010
Springer
We propose a unified global entropy reduction maximization (GERM) framework for active learning and semi-supervised learning for speech recognition. Active learning aims to select...
DC
2008
14 years 9 months ago
2008
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
101
click to vote
NECO
2007
14 years 9 months ago
2007
The persistent modification of synaptic efficacy as a function of the relative timing of pre- and postsynaptic spikes is a phenomenon known as spiketiming-dependent plasticity (...