Sciweavers

7259 search results - page 1220 / 1452
» From Fields to Trees
Sort
View
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic programming with primitive recursion
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
Stefan Kahrs
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 10 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
INFOCOM
2000
IEEE
15 years 10 months ago
A Modular Approach to Packet Classification: Algorithms and Results
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...
Thomas Y. C. Woo
KDD
2000
ACM
114views Data Mining» more  KDD 2000»
15 years 10 months ago
Learning Prosodic Patterns for Mandarin Speech Synthesis
Higher quality synthesized speech is required for widespread use of text-to-speech (TTS) technology, and prosodic pattern is the key feature that makes synthetic speech sound unna...
Yiqiang Chen, Wen Gao, Tingshao Zhu
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
15 years 10 months ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
« Prev « First page 1220 / 1452 Last » Next »