5244 search results - page 173 / 1049 » Structural Complexity of AvgBPP |
136
click to vote
ENTCS
2008
15 years 4 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
134
Voted
PAMI
2008
15 years 4 months ago
2008
Abstract-- Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increas...
159
click to vote
DATESO
2009
15 years 2 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
179
Voted
TOG
2012
13 years 7 months ago
2012
We present an approach to synthesizing shapes from complex domains, by identifying new plausible combinations of components from existing shapes. Our primary contribution is a new...
147
click to vote
CSL
2009
Springer
15 years 8 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...