Sciweavers

661 search results - page 60 / 133
» Argument Reduction by Factoring
Sort
View
ICIAR
2011
Springer
14 years 1 months ago
Lossless Compression of Satellite Image Sets Using Spatial Area Overlap Compensation
Abstract. In this paper we present a new prediction technique to compress a pair of satellite images that have significant overlap in the underlying spatial areas. When this predi...
Vivek Trivedi, Howard Cheng
AMKM
2003
Springer
15 years 3 months ago
Agentized, Contextualized Filters for Information Management
Every time a user engaged in work reads or writes, the user spontaneously generates new information needs: to understand the text he or she is reading or to supply more substance ...
David A. Evans, Gregory Grefenstette, Yan Qu, Jame...
TCAD
2008
172views more  TCAD 2008»
14 years 9 months ago
General Methodology for Soft-Error-Aware Power Optimization Using Gate Sizing
Power consumption has emerged as the premier and most constraining aspect in modern microprocessor and application-specific designs. Gate sizing has been shown to be one of the mos...
Foad Dabiri, Ani Nahapetian, Tammara Massey, Miodr...
CODES
2007
IEEE
15 years 1 months ago
Influence of procedure cloning on WCET prediction
For the worst-case execution time (WCET) analysis, especially loops are an inherent source of unpredictability and loss of precision. This is caused by the difficulty to obtain sa...
Paul Lokuciejewski, Heiko Falk, Martin Schwarzer, ...
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 7 days ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx