Sciweavers

3096 search results - page 440 / 620
» Theory and Use of the EM Algorithm
Sort
View
POPL
2003
ACM
16 years 6 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
16 years 6 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman
ICFP
2008
ACM
16 years 6 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
WSDM
2010
ACM
215views Data Mining» more  WSDM 2010»
16 years 3 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 3 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