3172 search results - page 6 / 635 » On the Random-Self-Reducibility of Complete Sets |
MLQ
2007
15 years 5 months ago
2007
Assume that there is no quasi-measurable cardinal not greater than 2ω . We show that for a c.c.c. σ-ideal I with a Borel base of subsets of an uncountable Polish space, if A is a...
169
Voted
IALP
2009
15 years 3 months ago
2009
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
225
click to vote
GC
2012
Springer
14 years 1 months ago
2012
Springer
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...
151
click to vote
LICS
2009
IEEE
16 years 20 days ago
2009
IEEE
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
127
click to vote
DM
1999
15 years 5 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...