Sciweavers

74 search results - page 6 / 15
» The Complexity of Black-Box Ring Problems
Sort
View
NIPS
2008
13 years 9 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 8 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
IJAR
2006
92views more  IJAR 2006»
13 years 8 months ago
Possibilistic clustering approach to trackless ring Pattern Recognition in RICH counters
The pattern recognition problem in Ring Imaging CHerenkov (RICH) counters concerns the identification of an unknown number of rings whose centers and radii are assumed to be unkno...
A. M. Massone, Léonard Studer, Francesco Ma...
ALGOSENSORS
2006
Springer
13 years 11 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
LICS
2000
IEEE
14 years 9 days ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki