11397 search results - page 56 / 2280 » A Relational Abstraction for Functions |
PLDI
2011
ACM
13 years 23 days ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
ICIP
1998
IEEE
14 years 11 months ago
1998
IEEE
Abstract- We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the Bspline of degree .L - 1 and ...
WER
2000
Springer
14 years 1 months ago
2000
Springer
Distributed database design is a complex process that involves a set of distinct aspects for the accomplishment of an adequate data distribution (Buretta 1997). Many of these aspec...
DBPL
1997
Springer
14 years 2 months ago
1997
Springer
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...