Sciweavers

268 search results - page 25 / 54
» Recursion Theoretic Operators for Function Complexity Classe...
Sort
View
DIS
2007
Springer
15 years 3 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
88
Voted
FLAIRS
2007
14 years 12 months ago
Compositional Belief Update
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to pro...
James P. Delgrande, Francis Jeffry Pelletier, Matt...
82
Voted
CCA
2009
Springer
15 years 4 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 3 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
76
Voted
VLDB
2004
ACM
113views Database» more  VLDB 2004»
15 years 3 months ago
Resource Sharing in Continuous Sliding-Window Aggregates
We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important...
Arvind Arasu, Jennifer Widom