1431 search results - page 29 / 287 » The complexity of random ordered structures |
NIPS
2008
14 years 11 months ago
2008
Randomly connected recurrent neural circuits have proven to be very powerful models for online computations when a trained memoryless readout function is appended. Such Reservoir ...
74
Voted
TWC
2008
14 years 9 months ago
2008
Space-time block codes (STBCs) from coordinate interleaved orthogonal designs (CIODs) have attracted considerable attention lately due to their full-diversity and single-symbol dec...
103
click to vote
SDM
2012
SIAM
13 years 1 days ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
CMSB
2006
Springer
15 years 1 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
120
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...