Sciweavers

2181 search results - page 332 / 437
» The restriction scaffold problem
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 11 days ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
DBPL
1991
Springer
98views Database» more  DBPL 1991»
14 years 11 days ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
CSL
2009
Springer
14 years 7 days ago
Intersection, Universally Quantified, and Reference Types
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
Mariangiola Dezani-Ciancaglini, Paola Giannini, Si...
ECCV
2010
Springer
14 years 5 days ago
Exploring Ambiguities for Monocular Non-Rigid Shape Estimation
Recovering the 3D shape of deformable surfaces from single images is difficult because many different shapes have very similar projections. This is commonly addressed by restricti...
EDBTW
2010
Springer
14 years 4 days ago
Flexible Dataspace Management Through Model Management
The vision of dataspaces has been articulated as providing various of the benefits of classical data integration but with reduced up-front costs, which, combined with opportunitie...
Cornelia Hedeler, Khalid Belhajjame, Lu Mao, Norma...