Sciweavers

39 search results - page 3 / 8
» Compiling pattern matching to good decision trees
Sort
View
CC
2005
Springer
123views System Software» more  CC 2005»
14 years 27 days ago
XML Goes Native: Run-Time Representations for Xtatic
Abstract. Xtatic is a lightweight extension of C offering native support for statically typed XML processing. XML trees are built-in values in Xtatic, and static analysis of the t...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 7 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
CASES
2007
ACM
13 years 11 months ago
Compiler generation from structural architecture descriptions
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
Florian Brandner, Dietmar Ebner, Andreas Krall
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 7 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
KDD
2009
ACM
196views Data Mining» more  KDD 2009»
14 years 2 months ago
WhereNext: a location predictor on trajectory pattern mining
The pervasiveness of mobile devices and location based services is leading to an increasing volume of mobility data. This side effect provides the opportunity for innovative meth...
Anna Monreale, Fabio Pinelli, Roberto Trasarti, Fo...