461 search results - page 59 / 93 » Bounds for Validation |
93
Voted
DAC
2008
ACM
16 years 2 months ago
2008
ACM
Since process and environmental variations can no longer be ignored in high-performance microprocessor designs, it is necessary to develop techniques for computing the sensitiviti...
115
click to vote
IPMI
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
101
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
183
Voted
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
119
Voted
SIGMOD
2004
ACM
16 years 1 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...