CSR
2007
Springer
13 years 8 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
KDD
1998
ACM
13 years 8 months ago
1998
ACM
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
ITC
1998
IEEE
13 years 8 months ago
1998
IEEE
This work proposes an approach to generate weighted random patterns which can maximally excite a circuit during its burn-in testing. The approach is based on a probability model a...
ICIAP
1999
ACM
13 years 8 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
WACV
2002
IEEE
13 years 9 months ago
2002
IEEE
We present a velocity-constrained front propagation approach for myocardium segmentation from magnetic resonance intensity image (MRI) and its matching phase contrast velocity (PC...
ICTAI
2003
IEEE
13 years 9 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
SBIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
ICS
2004
Tsinghua U.
13 years 10 months ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
WINE
2005
Springer
13 years 10 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...