4007 search results - page 312 / 802 » Computation with imprecise probabilities |
224
click to vote
SIBGRAPI
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
199
click to vote
SPAA
2005
ACM
16 years 1 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
211
click to vote
SPAA
2005
ACM
16 years 1 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
177
click to vote
ICANN
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. In this paper we propose a new distance metric for probability density functions (PDF). The main advantage of this metric is that unlike the popular Kullback-Liebler (KL)...
195
click to vote
GC
2004
Springer
16 years 25 days ago
2004
Springer
Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participat...