Sciweavers

4670 search results - page 207 / 934
» Testing that distributions are close
Sort
View
ERCIMDL
2009
Springer
138views Education» more  ERCIMDL 2009»
15 years 4 months ago
A Hybrid Distributed Architecture for Indexing
This paper presents a hybrid scavenger grid as an underlying hardware architecture for search services within digital libraries. The hybrid scavenger grid consists of both dedicate...
Ndapandula Nakashole, Hussein Suleman
ENGL
2007
73views more  ENGL 2007»
15 years 6 months ago
Cognitive Design Features on Traffic Signs
—The success of effective communication of traffic sign messages to road users may not only relate to the user characteristics but also the signs themselves. The purpose of this ...
Annie W. Y. Ng, Alan H. S. Chan
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
16 years 6 months ago
A sublinear algorithm for weakly approximating edit distance
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
Tugkan Batu, Funda Ergün, Joe Kilian, Avner M...
SEFM
2007
IEEE
16 years 26 days ago
Proving Termination by Divergence
We describe a simple and efficient algorithm for proving the termination of a class of loops with nonlinear assignments to variables. The method is based on divergence testing fo...
Domagoj Babic, Alan J. Hu, Zvonimir Rakamaric, Byr...
ICANN
2005
Springer
16 years 3 days ago
Can Dynamic Neural Filters Produce Pseudo-Random Sequences?
Abstract. Dynamic neural filters (DNFs) are recurrent networks of binary neurons. Under proper conditions of their synaptic matrix they are known to generate exponentially large c...
Yishai M. Elyada, David Horn