Sciweavers

6102 search results - page 1048 / 1221
» Generating Optimizing Specializers
Sort
View
LCPC
2005
Springer
15 years 10 months ago
Dynamic Compilation for Reducing Energy Consumption of I/O-Intensive Applications
Tera-scale high-performance computing has enabled scientists to tackle very large and computationally challenging scientific problems, making the advancement of scientific discov...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir, A...
SEKE
2005
Springer
15 years 10 months ago
Application of Design Combinatorial Theory to Scenario-Based Software Architecture Analysis
Design combinatorial theory for test-case generation has been used successfully in the past. It is useful in optimizing test cases as it is practically impossible to exhaustively t...
Chung-Horng Lung, Marzia Zaman
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
15 years 10 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 10 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
VLSM
2005
Springer
15 years 10 months ago
Entropy Controlled Gauss-Markov Random Measure Field Models for Early Vision
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
Mariano Rivera, Omar Ocegueda, José L. Marr...
« Prev « First page 1048 / 1221 Last » Next »