Sciweavers

3038 search results - page 102 / 608
» High-Speed Function Approximation
Sort
View
AMC
2005
154views more  AMC 2005»
15 years 2 months ago
Solving Laplacian problems with boundary singularities: a comparison of a singular function boundary integral method with the p/
We solve a Laplacian problem over an L-shaped domain using a singular function boundary integral method as well as the p/hp finite element method. In the former method, the soluti...
Miltiades Elliotis, Georgios Georgiou, Christos Xe...
126
Voted
CAGD
2005
75views more  CAGD 2005»
15 years 2 months ago
s-power series: an alternative to Poisson expansions for representing analytic functions
Morin and Goldman [Computer Aided Geometric Design 17 (2000) 813] have recently presented a remarkable new framework, based on employing Poisson series, for describing analytic fu...
Javier Sánchez-Reyes, Jesús Miguel C...
117
Voted
NAACL
2010
15 years 13 days ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes
COMPGEOM
2007
ACM
15 years 6 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
120
Voted
UAI
2008
15 years 4 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht