1949 search results - page 364 / 390 » Random graphs on surfaces |
109
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper presents a graph-based approach for spoken term detection. Each first-pass retrieved utterance is a node on a graph and the edge between two nodes is weighted by the s...
171
click to vote
ESOP
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
133
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
133
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
139
click to vote
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...