2423 search results - page 205 / 485 » AnswerArt - Contextualized Question Answering |
186
click to vote
TCS
2008
15 years 6 months ago
2008
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...
146
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
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 ...
116
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
We provide a much shorter proof of the following partition theorem of P. Erdos and R. Rado: If X is an uncountable linear order into which neither 1 nor 1 embeds, then X (, 4)3 f...
175
click to vote
ACL
2009
15 years 4 months ago
2009
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
213
click to vote
APAL
2011
15 years 1 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...