Sciweavers

2168 search results - page 65 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
127
Voted
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 27 days ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
150
Voted
SIAMMA
2011
97views more  SIAMMA 2011»
14 years 6 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 1 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
130
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
121
Voted
CICLING
2007
Springer
15 years 9 months ago
Dependency Analysis and CBR to Bridge the Generation Gap in Template-Based NLG
The present paper describes how dependency analysis can be used to automatically extract from a corpus a set of cases - and an accompanying vocabulary - which enable a template-bas...
Virginia Francisco, Raquel Hervás, Pablo Ge...