Sciweavers

1763 search results - page 4 / 353
» A Formalization of Polytime Functions
Sort
View
SAS
2005
Springer
13 years 11 months ago
A Relational Abstraction for Functions
Bertrand Jeannet, Denis Gopan, Thomas W. Reps
POPL
2012
ACM
12 years 1 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
14 years 6 days ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
AIPS
2009
13 years 6 months ago
Structural-Pattern Databases
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
Michael Katz, Carmel Domshlak
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 1 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...