967 search results - page 33 / 194 » On the efficiency of adaptive MCMC algorithms |
ETT
2002
14 years 9 months ago
2002
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously pr...
163
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
CVGIP
2004
14 years 9 months ago
2004
In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in term...
DAWAK
1999
Springer
15 years 1 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...