1998 search results - page 159 / 400 » Complexity of the Cover Polynomial |
162
click to vote
EACL
1993
ACL Anthology
15 years 7 months ago
1993
ACL Anthology
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
165
click to vote
MTA
2000
15 years 6 months ago
2000
In this paper we present our research and development experience in the context of Interactive Multimedia Documents (IMDs). We define a rich model for such documents covering the ...
150
click to vote
TRIDENTCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Prototyping future Internet technologies is an important but complicated task, mainly caused by incompatibilities to existing systems and high implementation complexity. To reduce ...
147
click to vote
SMI
2007
IEEE
16 years 23 days ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
160
click to vote
KER
2008
15 years 6 months ago
2008
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...