Sciweavers

257 search results - page 7 / 52
» Computability over The Partial Continuous Functionals
Sort
View
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 2 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
TAMC
2010
Springer
14 years 2 months ago
Binary De Bruijn Partial Words with One Hole
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
Francine Blanchet-Sadri, Jarett Schwartz, Slater S...
SIGMOD
2005
ACM
146views Database» more  SIGMOD 2005»
14 years 11 months ago
Predicate Result Range Caching for Continuous Queries
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
Matthew Denny, Michael J. Franklin
MSS
2008
IEEE
82views Hardware» more  MSS 2008»
13 years 10 months ago
Revealed preference and indifferent selection
It is shown that preferences can be constructed from observed choice behavior in a way that is robust to indifferent selection (i.e., the agent is indifferent between two alternat...
Eric Danan
PVLDB
2010
97views more  PVLDB 2010»
13 years 9 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande