Sciweavers

2745 search results - page 145 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
SDM
2007
SIAM
201views Data Mining» more  SDM 2007»
15 years 8 months ago
Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis ...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
TMM
2008
201views more  TMM 2008»
15 years 6 months ago
Fast Best-Match Shape Searching in Rotation-Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
RECONFIG
2008
IEEE
224views VLSI» more  RECONFIG 2008»
16 years 1 months ago
Automatic Construction of Large-Scale Regular Expression Matching Engines on FPGA
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
Yi-Hua E. Yang, Viktor K. Prasanna
JAIR
2006
179views more  JAIR 2006»
15 years 6 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
SC
2003
ACM
16 years 2 days ago
Fast Parallel Non-Contiguous File Access
Many applications of parallel I/O perform non-contiguous file accesses: instead of accessing a single (large) block of data in a file, a number of (smaller) blocks of data scatt...
Joachim Worringen, Jesper Larsson Träff, Hube...