5100 search results - page 297 / 1020 » The Linear Complexity of a Graph |
134
click to vote
EMNLP
2009
15 years 2 months ago
2009
Unknown lexical items present a major obstacle to the development of broadcoverage semantic role labeling systems. We address this problem with a semisupervised learning approach ...
138
Voted
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
140
click to vote
SIROCCO
2010
15 years 6 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
103
click to vote
DAM
2006
15 years 4 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
116
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...