Sciweavers

617 search results - page 32 / 124
» Patterns for decoupling data structures and algorithms
Sort
View
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
14 years 7 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
FPCA
1995
13 years 11 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
ECCV
2010
Springer
13 years 10 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
14 years 8 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
AUTOID
2005
IEEE
14 years 1 months ago
A Fast Algorithm for ICP-Based 3D Shape Biometrics
In a biometrics scenario, gallery images are enrolled into the database ahead of the matching step, which gives us the opportunity to build related data structures before the prob...
Ping Yan, Kevin W. Bowyer