Sciweavers

292 search results - page 5 / 59
» Exploiting Dead Value Information
Sort
View
IEEECIT
2010
IEEE
13 years 6 months ago
Superblock-Based Source Code Optimizations for WCET Reduction
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
Paul Lokuciejewski, Timon Kelter, Peter Marwedel
GIS
2010
ACM
13 years 6 months ago
Exploiting local node cache in top-k queries within wireless sensor networks
Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
Johannes Niedermayer, Mario A. Nascimento, Matthia...
CC
2001
Springer
13 years 11 months ago
Goal-Directed Value Profiling
Compilers can exploit knowledge that a variable has a fixed known value at a program point for optimizations such as code specialization and constant folding. Recent work has shown...
Scott A. Watterson, Saumya K. Debray
MLDM
2005
Springer
14 years 28 days ago
A Grouping Method for Categorical Attributes Having Very Large Number of Values
In supervised machine learning, the partitioning of the values (also called grouping) of a categorical attribute aims at constructing a new synthetic attribute which keeps the info...
Marc Boullé
ICASSP
2009
IEEE
13 years 5 months ago
Intensity vector direction exploitation for exhaustive blind source separation of convolutive mixtures
This article presents a technique that uses the intensity vector direction exploitation (IVDE) method for exhaustive separation of convolutive mixtures. While only a four-element ...
Banu Gunel, Hüseyin Hacihabiboglu, Ahmet M. K...