Sciweavers

1957 search results - page 68 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ISMIS
2005
Springer
15 years 3 months ago
A Probabilistic Approach to Finding Geometric Objects in Spatial Datasets of the Milky Way
Data from the Sloan Digital Sky Survey has given evidence of structures within the Milky Way halo from other nearby galaxies. Both the halo and these structures are approximated by...
Jon Purnell, Malik Magdon-Ismail, Heidi Jo Newberg
WSC
2000
14 years 11 months ago
A practical approach to sample-path simulation optimization
We propose solving continuous parametric simulation optimizations using a deterministic nonlinear optimization algorithm and sample-path simulations. The optimization problem is w...
Michael C. Ferris, Todd S. Munson, Krung Sinapirom...
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
15 years 10 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
CGF
2010
157views more  CGF 2010»
14 years 7 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
SIGCOMM
1999
ACM
15 years 2 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves