9842 search results - page 1349 / 1969 » The Complexity of the Matching-Cut Problem |
194
Voted
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
— Serious efforts to develop computerized systems for natural language understanding and machine translation have taken place for more than half a century. Some successful system...
179
click to vote
SEMCO
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present an approach which, given a knowledge base and an appropriate text corpus, automatically induces patterns which can be used to query the knowledge base. W...
207
Voted
DAGM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
211
click to vote
DEXA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
198
Voted
EUROCRYPT
2007
Springer
16 years 1 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...