Sciweavers

2440 search results - page 215 / 488
» Data-Intensive Question Answering
Sort
View
JSYML
2006
62views more  JSYML 2006»
15 years 4 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller
MLQ
2006
84views more  MLQ 2006»
15 years 4 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen
APAL
2005
88views more  APAL 2005»
15 years 4 months ago
Dependence relations in computably rigid computable vector spaces
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...
Rumen D. Dimitrov, Valentina S. Harizanov, Andrei ...
TCS
2008
15 years 4 months ago
Election and rendezvous with incomparable labels
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
Jérémie Chalopin
CORR
2004
Springer
102views Education» more  CORR 2004»
15 years 4 months ago
Unfolding Smooth Primsatoids
Nadia Benbernou Patricia Cahn Joseph O'Rourke We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth ...
Nadia Benbernou, Patricia Cahn, Joseph O'Rourke