Sciweavers

3038 search results - page 74 / 608
» High-Speed Function Approximation
Sort
View
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 11 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 5 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige
SCALESPACE
2007
Springer
15 years 10 months ago
On the Statistical Interpretation of the Piecewise Smooth Mumford-Shah Functional
In region-based image segmentation, two models dominate the field: the Mumford-Shah functional and statistical approaches based on Bayesian inference. Whereas the latter allow for...
Thomas Brox, Daniel Cremers
SAC
2006
ACM
15 years 10 months ago
Building the functional performance model of a processor
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
Alexey L. Lastovetsky, Ravi Reddy, Robert Higgins
ICIP
2006
IEEE
16 years 6 months ago
Hardware Computation of Moment Functions in a Silicon Retina using Binary Patterns
We present in this paper a method for implementing moment functions in a CMOS retina for shape recognition applications. The method is based on the use of binary patterns and it a...
Olivier Aubreton, Lew Fock Chong Lew Yan Voon, Guy...