4007 search results - page 196 / 802 » Computation with imprecise probabilities |
161
click to vote
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
118
click to vote
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a forward spotting scheme that executes gesture segmentation and recognition simultaneously by detecting start point. By using competitive differential o...
128
click to vote
RANDOM
1999
Springer
15 years 8 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
122
click to vote
RANDOM
1998
Springer
15 years 8 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
113
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...