2907 search results - page 51 / 582 » Presentations of Structures in Admissible Sets |
113
Voted
EACL
2009
ACL Anthology
16 years 1 months ago
2009
ACL Anthology
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
110
click to vote
WEBI
2009
Springer
15 years 7 months ago
2009
Springer
The emergence of scale free and small world properties in real world complex networks has stimulated lots of activity in the field of network analysis. An example of such a netwo...
86
Voted
ACL
2003
15 years 2 months ago
2003
We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for p...
107
click to vote
IPCO
1992
15 years 1 months ago
1992
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
90
Voted
IWANN
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...