Sciweavers

87 search results - page 16 / 18
» A Theoretical Comparison of Monte Carlo Radiosity Algorithms
Sort
View
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
14 years 10 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
WWW
2005
ACM
15 years 10 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 4 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
ISBI
2008
IEEE
15 years 10 months ago
FMRI brain activity and underlying hemodynamics estimation in a new Bayesian framework
The emerging functional MRI (Magnetic Resonance Imaging), fMRI, imaging modality was developed to obtain non-invasive information regarding the neural processes behind pre-determi...
David M. Afonso, João M. Sanches, Martin H....
GLOBECOM
2009
IEEE
15 years 4 months ago
Sparse Decoding of Low Density Parity Check Codes Using Margin Propagation
—One of the key factors underlying the popularity of Low-density parity-check (LDPC) code is its iterative decoding algorithm that is amenable to efficient hardware implementati...
Ming Gu, Kiran Misra, Hayder Radha, Shantanu Chakr...