Sciweavers

393 search results - page 35 / 79
» Approximation Algorithm for Directed Telephone Multicast Pro...
Sort
View
CORR
2011
Springer
204views Education» more  CORR 2011»
14 years 4 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
CISS
2008
IEEE
15 years 4 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
ICASSP
2011
IEEE
14 years 1 months ago
Langevin and hessian with fisher approximation stochastic sampling for parameter estimation of structured covariance
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
Cornelia Vacar, Jean-François Giovannelli, ...
AAAI
2007
15 years 21 hour ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
CAGD
2004
76views more  CAGD 2004»
14 years 9 months ago
Topologically consistent trimmed surface approximations based on triangular patches
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
Rida T. Farouki, Chang Yong Han, Joel Hass, Thomas...