Sciweavers

3652 search results - page 481 / 731
» A study of query length
Sort
View
IJACT
2008
158views more  IJACT 2008»
15 years 6 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
IJRR
2008
115views more  IJRR 2008»
15 years 6 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
IPL
2008
95views more  IPL 2008»
15 years 6 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
COGSCI
2007
107views more  COGSCI 2007»
15 years 6 months ago
The Dynamics of Lexical Competition During Spoken Word Recognition
The sounds that make up spoken words are heard in a series and must be mapped rapidly onto words in memory because their elements, unlike those of visual words, cannot simultaneou...
James S. Magnuson, James A. Dixon, Michael K. Tane...
COMBINATORICA
2007
92views more  COMBINATORICA 2007»
15 years 6 months ago
Codes And Xor Graph Products
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
Noga Alon, Eyal Lubetzky