660 search results - page 117 / 132 » The Implicit Calculus of Constructions |
162
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
164
click to vote
ERSHOV
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
176
click to vote
STACS
2007
Springer
15 years 12 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
162
click to vote
SAC
2006
ACM
15 years 11 months ago
2006
ACM
This paper studies ways for modularizing transformation definitions in current rule-based model transformation languages. Two scenarios are shown in which the modular units are id...
173
click to vote
CCCG
2003
15 years 7 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...