Sciweavers

1391 search results - page 146 / 279
» Optimally Sparse Frames
Sort
View
150
Voted
PLDI
2003
ACM
15 years 9 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
NETWORKING
2010
15 years 6 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 5 months ago
Unsupervised learning of echo state networks: balancing the double pole
A possible alternative to fine topology tuning for Neural Network (NN) optimization is to use Echo State Networks (ESNs), recurrent NNs built upon a large reservoir of sparsely r...
Fei Jiang, Hugues Berry, Marc Schoenauer
ICCV
2007
IEEE
16 years 6 months ago
Multi-View Stereo for Community Photo Collections
We present a multi-view stereo algorithm that addresses the extreme changes in lighting, scale, clutter, and other effects in large online community photo collections. Our idea is...
Michael Goesele, Noah Snavely, Brian Curless, Hugu...
WEBI
2009
Springer
15 years 11 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova