Sciweavers

1458 search results - page 135 / 292
» Monads for incremental computing
Sort
View
LICS
2006
IEEE
16 years 14 days ago
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. ...
EACL
2006
ACL Anthology
15 years 7 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
Stuart M. Shieber
ICFP
2010
ACM
15 years 7 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
CVPR
2010
IEEE
16 years 2 months ago
Efficient Histogram-Based Sliding Window
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computat...
Yichen Wei, Litian Tao
ICCV
2007
IEEE
16 years 8 months ago
Graph Based Discriminative Learning for Robust and Efficient Object Tracking
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
Xiaoqin Zhang, Weiming Hu, Stephen J. Maybank, Xi ...