Sciweavers

3096 search results - page 488 / 620
» The Generalized FITC Approximation
Sort
View
PADO
2001
Springer
15 years 9 months ago
Run-Time Bytecode Specialization
This paper describes a run-time specialization system for the Java language. One of the main difficulties of supporting the full Java language resides in a sound yet effective ma...
Hidehiko Masuhara, Akinori Yonezawa
ICC
2000
IEEE
15 years 9 months ago
Reduced-State BCJR-Type Algorithms
—In this paper, we propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorithms with a structure similar to that of the well-known algorit...
Giulio Colavolpe, Gian Luigi Ferrari, Riccardo Rah...
PLDI
2000
ACM
15 years 9 months ago
Functional reactive programming from first principles
Functional Reactive Programming, or FRP, is a general framework for programming hybrid systems in a high-level, declarative manner. The key ideas in FRP are its notions of behavio...
Zhanyong Wan, Paul Hudak
158
Voted
PODS
2000
ACM
112views Database» more  PODS 2000»
15 years 9 months ago
Auditing Boolean Attributes
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
Jon M. Kleinberg, Christos H. Papadimitriou, Prabh...
136
Voted
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 9 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch