Sciweavers

4229 search results - page 632 / 846
» On the Optimality of Spiral Search
Sort
View
SAC
2008
ACM
15 years 6 months ago
Power-efficient and scalable load/store queue design via address compression
This paper proposes an address compression technique for load/store queue (LSQ) to improve the scalability and power efficiency. A load/store queue (LSQ) typically needs a fullyas...
Yi-Ying Tsai, Chia-Jung Hsu, Chung-Ho Chen
IJDAR
2010
88views more  IJDAR 2010»
15 years 5 months ago
A robust model for on-line handwritten japanese text recognition
This paper describes a robust model for on-line handwritten Japanese text recognition. The method evaluates the likelihood of candidate segmentation paths by combining scores of c...
Bilan Zhu, Xiang-Dong Zhou, Cheng-Lin Liu, Masaki ...
PROCEDIA
2010
113views more  PROCEDIA 2010»
15 years 5 months ago
Exploring utilisation of GPU for database applications
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
Slawomir Walkowiak, Konrad Wawruch, Marita Nowotka...
ACL
2010
15 years 4 months ago
Hierarchical A* Parsing with Bridge Outside Scores
Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
Adam Pauls, Dan Klein
DATESO
2010
150views Database» more  DATESO 2010»
15 years 4 months ago
Evolving Quasigroups by Genetic Algorithms
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
Václav Snásel, Jiri Dvorský, ...