Sciweavers

16257 search results - page 347 / 3252
» D-finiteness: algorithms and applications
Sort
View
ICDCSW
2008
IEEE
16 years 1 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
ICDIM
2008
IEEE
16 years 1 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
CHES
2007
Springer
115views Cryptology» more  CHES 2007»
16 years 29 days ago
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when...
Marc Joye
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
16 years 5 days ago
Evolving Wavelets Using a Coevolutionary Genetic Algorithm and Lifting
Finding a good wavelet for a particular application and type of input data is a difficult problem. Traditional methods of wavelet deus on abstract properties of the wavelet that ca...
Uli Grasemann, Risto Miikkulainen
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
15 years 11 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...