1127 search results - page 130 / 226 » Value Compression for Efficient Computation |
140
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Most page segmentation algorithms have userspecifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values fo...
162
click to vote
PLDI
1996
ACM
15 years 10 months ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
139
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
157
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
169
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
Code specialization is a way to obtain significant improvement in the performance of an application. It works by exposing values of different parameters in source code. The availa...