Sciweavers

1612 search results - page 83 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 7 days ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
STACS
2009
Springer
15 years 2 months ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi
BMCBI
2006
109views more  BMCBI 2006»
14 years 10 months ago
A computational approach to discovering the functions of bacterial phytochromes by analysis of homolog distributions
Background: Phytochromes are photoreceptors, discovered in plants, that control a wide variety of developmental processes. They have also been found in bacteria and fungi, but for...
Tilman Lamparter
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
14 years 11 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
JSAC
2010
138views more  JSAC 2010»
14 years 8 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar