Sciweavers

541 search results - page 30 / 109
» An Efficient Algorithm for the Longest Pattern Subsequence P...
Sort
View
CIKM
2008
Springer
13 years 10 months ago
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
Lian'en Huang, Lei Wang, Xiaoming Li
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 8 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
TPDS
1998
92views more  TPDS 1998»
13 years 8 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 9 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
ICCV
2003
IEEE
14 years 10 months ago
A Segmentation Algorithm for Contrast-Enhanced Images
Medical imaging often involves the injection of contrast agents and the subsequent analysis of tissue enhancement patterns. Many important types of tissue have characteristic enha...
Junhwan Kim, Ramin Zabih