Sciweavers

1952 search results - page 293 / 391
» Complete partitions of graphs
Sort
View
CASES
2008
ACM
15 years 8 months ago
Control flow optimization in loops using interval analysis
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
Mohammad Ali Ghodrat, Tony Givargis, Alex Nicolau
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
15 years 8 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco
ISSRE
2007
IEEE
15 years 8 months ago
Generating Trace-Sets for Model-based Testing
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
Birgitta Lindström, Paul Pettersson, Jeff Off...
SDM
2007
SIAM
176views Data Mining» more  SDM 2007»
15 years 7 months ago
Adaptive Concept Learning through Clustering and Aggregation of Relational Data
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
Hichem Frigui, Cheul Hwang
BNCOD
2003
91views Database» more  BNCOD 2003»
15 years 7 months ago
Persistent Indexing Technology for Large Sequences
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, usin...
Robert Japp