Sciweavers

287 search results - page 14 / 58
» On the Complexity of Register Coalescing
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
CPM
2009
Springer
137views Combinatorics» more  CPM 2009»
14 years 2 months ago
The Structure of Level-k Phylogenetic Networks
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
Philippe Gambette, Vincent Berry, Christophe Paul
IJES
2007
79views more  IJES 2007»
13 years 7 months ago
Energy-aware compilation and hardware design for VLIW embedded systems
Abstract: Tomorrow’s embedded devices need to run high-resolution multimedia applications which need an enormous computational complexity with a very low energy consumption const...
José L. Ayala, Marisa López-Vallejo,...
WAIFI
2007
Springer
175views Mathematics» more  WAIFI 2007»
14 years 1 months ago
Attacking the Filter Generator over GF (2 m )
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
Sondre Rønjom, Tor Helleseth
BMCBI
2008
135views more  BMCBI 2008»
13 years 7 months ago
Fregene: Simulation of realistic sequence-level data in populations and ascertained samples
Background: FREGENE simulates sequence-level data over large genomic regions in large populations. Because, unlike coalescent simulators, it works forwards through time, it allows...
Marc Chadeau-Hyam, Clive J. Hoggart, Paul F. O'Rei...