16430 search results - page 500 / 3286 » On Computable Tree Functions |
215
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
158
click to vote
ICALP
1999
Springer
15 years 11 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
172
click to vote
FMOODS
2007
15 years 8 months ago
2007
We present the first tool that offers dynamic verification of extended traints on UML models. It translates a UML model into an Abstract State (ASM) which is transformed by an AS...
165
click to vote
ENTCS
2007
15 years 7 months ago
2007
In this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative langu...
192
click to vote
CVPR
1996
IEEE
16 years 9 months ago
1996
IEEE
This paper presents a general formulation enabling determination of all functions that are steerable under any transformation group. These steerable functions are determinedunique...