2576 search results - page 173 / 516 » The Complexity of Zero Knowledge |
137
click to vote
ESWS
2007
Springer
16 years 5 days ago
2007
Springer
Large and complex enterprise systems face the same kind of information processing problems that exist on the web in general, and constructing an ontology is a crucial part of many ...
152
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
143
click to vote
ICDAR
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper I will try to explain the nature of document understanding in all of its dimensions. Therefore I will first describe the characteristics of data, knowledge, and info...
173
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
128
click to vote
DGCI
2000
Springer
15 years 10 months ago
2000
Springer
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...