1188 search results - page 9 / 238 » Generating Connectives |
112
click to vote
ESA
2006
Springer
15 years 3 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
JDCTA
2010
14 years 6 months ago
2010
We implement a Korean syntactic analyzer which decreases many ambiguities in syntax parse trees using segmentation and semantic connection units. We use dependency grammar for par...
113
click to vote
TCBB
2011
14 years 6 months ago
2011
Recent experimental advances facilitate the collection of time series data that indicate which genes in a cell are expressed. This paper proposes an efficient method to generate th...
DAM
2006
14 years 11 months ago
2006
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
105
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....