530 search results - page 72 / 106 » Bounds on marginal probability distributions |
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
ISTCS
1993
Springer
14 years 4 days ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
JACM
2011
13 years 3 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...
CDC
2008
IEEE
13 years 8 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...