Sciweavers

45 search results - page 7 / 9
» Efficient Embedding of Deterministic Test Data
Sort
View
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 6 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
ECCV
2008
Springer
13 years 7 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 6 months ago
A Framework for Clustering Uncertain Data Streams
Abstract-- In recent years, uncertain data management applications have grown in importance because of the large number of hardware applications which measure data approximately. F...
Charu C. Aggarwal, Philip S. Yu
DFT
2003
IEEE
79views VLSI» more  DFT 2003»
13 years 10 months ago
Hybrid BIST Using an Incrementally Guided LFSR
A new hybrid BIST scheme is proposed which is based on using an “incrementally guided LFSR.” It very efficiently combines external deterministic data from the tester with on-c...
C. V. Krishna, Nur A. Touba
CGO
2004
IEEE
13 years 9 months ago
VHC: Quickly Building an Optimizer for Complex Embedded Architectures
To meet the high demand for powerful embedded processors, VLIW architectures are increasingly complex (e.g., multiple clusters), and moreover, they now run increasingly sophistica...
Michael Dupré, Nathalie Drach, Olivier Tema...