Sciweavers

417 search results - page 8 / 84
» The Start of an Eiffel Standard
Sort
View
COLING
2010
13 years 2 months ago
Chasing the ghost: recovering empty categories in the Chinese Treebank
Empty categories represent an important source of information in syntactic parses annotated in the generative linguistic tradition, but empty category recovery has only started to...
Yaqin Yang, Nianwen Xue
JMLR
2011
110views more  JMLR 2011»
13 years 2 months ago
Training SVMs Without Offset
We develop, analyze, and test a training algorithm for support vector machine classifiers without offset. Key features of this algorithm are a new, statistically motivated stoppi...
Ingo Steinwart, Don R. Hush, Clint Scovel
JOLLI
2011
84views more  JOLLI 2011»
12 years 10 months ago
Semantically Restricted Argument Dependencies
This paper presents a new take on how argument dependencies in natural language are established and constrained. The paper starts with a rather standard view that (quantificationa...
Alastair Butler
TMA
2012
Springer
268views Management» more  TMA 2012»
12 years 3 months ago
Identifying Skype Nodes in the Network Exploiting Mutual Contacts
Abstract. In this paper we present an algorithm that is able to progressively discover nodes of a Skype overlay P2P network. Most notably, super nodes in the network core. Starting...
Jan Jusko, Martin Rehák
FUIN
2008
73views more  FUIN 2008»
13 years 7 months ago
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
This article investigates Krivine's realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by pre...
Paulo Oliva, Thomas Streicher