Sciweavers

1457 search results - page 122 / 292
» On the Uniform Distribution of Strings
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot
AMC
2007
108views more  AMC 2007»
15 years 6 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
ENGL
2006
70views more  ENGL 2006»
15 years 6 months ago
Strategies for Service Discovery over Ad Hoc Networks
Service discovery is an important and necessary component of ad hoc networks. To fit within the context of such networks, a post-query model with several service discovery strateg...
Michel Barbeau, Evangelos Kranakis, Honghui Luo
RSA
2006
144views more  RSA 2006»
15 years 6 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
SIGKDD
2008
159views more  SIGKDD 2008»
15 years 6 months ago
Data mining with cellular automata
A cellular automaton is a discrete, dynamical system composed of very simple, uniformly interconnected cells. Cellular automata may be seen as an extreme form of simple, localized...
Tom Fawcett