Sciweavers

6315 search results - page 200 / 1263
» Approximating Solution Structure
Sort
View
NA
2007
120views more  NA 2007»
15 years 6 months ago
On choosing "optimal" shape parameters for RBF approximation
Many radial basis function (RBF) methods contain a free shape parameter that plays an important role for the accuracy of the method. In most papers the authors end up choosing this...
Gregory E. Fasshauer, Jack G. Zhang
GLOBECOM
2010
IEEE
15 years 4 months ago
Approximation Ratios of Multicast Light-Trees in WDM Networks
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
Fen Zhou, Miklós Molnár, Bernard Cou...
JMLR
2010
148views more  JMLR 2010»
15 years 1 months ago
Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
Vicenç Gómez, Hilbert J. Kappen, Mic...
CVPR
2007
IEEE
16 years 8 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar