2079 search results - page 115 / 416 » Universality of random graphs |
147
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
149
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
127
click to vote
ECCC
2010
15 years 4 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
103
click to vote
IJON
2008
15 years 4 months ago
2008
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
154
Voted
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...