Sciweavers

151 search results - page 18 / 31
» DP-Miner: Design Pattern Discovery Using Matrix
Sort
View
MCS
2001
Springer
14 years 12 days ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred
ALMOB
2006
102views more  ALMOB 2006»
13 years 8 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
JCDL
2003
ACM
160views Education» more  JCDL 2003»
14 years 1 months ago
Automatic Document Metadata Extraction Using Support Vector Machines
Automatic metadata generation provides scalability and usability for digital libraries and their collections. Machine learning methods offer robust and adaptable automatic metadat...
Hui Han, C. Lee Giles, Eren Manavoglu, Hongyuan Zh...
TIP
2008
208views more  TIP 2008»
13 years 7 months ago
Vision Processing for Realtime 3-D Data Acquisition Based on Coded Structured Light
Structured light vision systems have been successfully used for accurate measurement of 3-D surfaces in computer vision. However, their applications are mainly limited to scanning ...
S. Y. Chen, Y. F. Li, Jianwei Zhang
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 6 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers