Sciweavers

4542 search results - page 70 / 909
» Design patterns for data structures
Sort
View
CIKM
2005
Springer
15 years 8 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
126
Voted
CIKM
2009
Springer
15 years 9 months ago
Frequent subgraph pattern mining on uncertain graph data
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang
ITC
2000
IEEE
101views Hardware» more  ITC 2000»
15 years 6 months ago
Reducing test data volume using external/LBIST hybrid test patterns
A common approachfor large industrial designs is to use logic built-in self-test (LBIST)followed by test data from an external tester. Because the fault coverage with LBIST alone ...
Debaleena Das, Nur A. Touba
114
Voted
GIS
2009
ACM
15 years 7 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider
96
Voted
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
16 years 2 months ago
Frequent pattern mining with uncertain data
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....
Charu C. Aggarwal, Yan Li, Jianyong Wang, Jing Wan...