Sciweavers

909 search results - page 45 / 182
» On the approximability of some network design problems
Sort
View
JMLR
2008
209views more  JMLR 2008»
15 years 1 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
15 years 8 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
TFS
2010
152views Education» more  TFS 2010»
14 years 8 months ago
Robust Optimal Reference-Tracking Design Method for Stochastic Synthetic Biology Systems: T-S Fuzzy Approach
At present, the development in the nascent field of synthetic gene networks is still difficult. Most newly created gene networks are nonfunctioning due to intrinsic parameter fluct...
Bor-Sen Chen, Chih-Hung Wu
TSP
2008
178views more  TSP 2008»
15 years 1 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
14 years 12 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha