Sciweavers

2877 search results - page 541 / 576
» Biological Computing
Sort
View
IANDC
2008
141views more  IANDC 2008»
14 years 9 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
GIS
2008
ACM
15 years 10 months ago
Density based co-location pattern discovery
Co-location pattern discovery is to find classes of spatial objects that are frequently located together. For example, if two categories of businesses often locate together, they ...
Xiangye Xiao, Xing Xie, Qiong Luo, Wei-Ying Ma
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
15 years 10 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
KDD
2004
ACM
108views Data Mining» more  KDD 2004»
15 years 10 months ago
Sleeved coclustering
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...
Avraham A. Melkman, Eran Shaham
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
15 years 10 months ago
Indexing multi-dimensional time-series with support for multiple distance measures
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
Michail Vlachos, Marios Hadjieleftheriou, Dimitrio...