Sciweavers

4155 search results - page 283 / 831
» Topic-Specific Optimization and Structuring
Sort
View
ICANN
2010
Springer
15 years 6 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 5 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
BMVC
2010
15 years 4 months ago
Sparse Sparse Bundle Adjustment
Sparse Bundle Adjustment (SBA) is a method for simultaneously optimizing a set of camera poses and visible points. It exploits the sparse primary structure of the problem, where c...
Kurt Konolige
PLDI
2011
ACM
14 years 9 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ATAL
2011
Springer
14 years 6 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the ïŹeld of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee