Sciweavers

17582 search results - page 2987 / 3517
» From Distributed Sequential Computing to Distributed Paralle...
Sort
View
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 10 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
EMNLP
2007
15 years 8 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage
ICML
2010
IEEE
15 years 7 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
CORR
2008
Springer
123views Education» more  CORR 2008»
15 years 6 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
166
Voted
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
15 years 6 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
« Prev « First page 2987 / 3517 Last » Next »