Sciweavers

124 search results - page 15 / 25
» Using Available Memory to Transform Graphplan's Search
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 6 days ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
ICPR
2008
IEEE
16 years 1 months ago
An incremental method for accurate iris segmentation
The paper presents an incremental method for accurate iris segmentation. Firstly, observing the characteristics of iris images, we search for a square region that contains pupil w...
Peihua Li, Xiaomin Liu
SIGMOD
1997
ACM
125views Database» more  SIGMOD 1997»
15 years 4 months ago
The Distributed Information Search Component (Disco) and the World Wide Web
The Distributed Information Search COmponent (Disco) is a prototype heterogeneous distributed database that accesses underlying data sources. The Disco prototype currently focuses...
Anthony Tomasic, Rémy Amouroux, Philippe Bo...
ICPP
2003
IEEE
15 years 5 months ago
FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
Adrian Driga, Paul Lu, Jonathan Schaeffer, Duane S...
ACMSE
2009
ACM
15 years 6 months ago
A case for compiler-driven superpage allocation
Most modern microprocessor-based systems provide support for superpages both at the hardware and software level. Judicious use of superpages can significantly cut down the number...
Joshua Magee, Apan Qasem