Sciweavers

4403 search results - page 562 / 881
» Galois Theory of Algorithms
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 7 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICFP
2008
ACM
16 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ICFP
2005
ACM
16 years 7 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
WSDM
2010
ACM
215views Data Mining» more  WSDM 2010»
16 years 5 months ago
GeoFolk: Latent spatial semantics in Web 2.0 social media
We describe an approach for multi-modal characterization of social media by combining text features (e.g. tags as a prominent example of short, unstructured text labels) with spat...
Sergej Sizov
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
16 years 5 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro