113 search results - page 5 / 23 » Data structures with dynamical random transitions |
133
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
146
Voted
COMGEO
1999
ACM
15 years 2 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
108
Voted
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
This work presents a cost-effective test structure that is applicable to built-in self-test of time-to-digital converters (TDCs). The proposed structure uses deterministic dynamic ...
131
click to vote
AAAI
2008
15 years 4 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
128
Voted
AIPS
2009
15 years 3 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...