1068 search results - page 108 / 214 » For completeness, sublogarithmic space is no space |
131
click to vote
DAWAK
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
105
click to vote
ACSC
2001
IEEE
15 years 5 months ago
2001
IEEE
We propose an effective methodology in which a distributed garbage collector may be derived from a distributed termination algorithm and a centralized garbage collector in a manne...
104
Voted
ECAI
1998
Springer
15 years 5 months ago
1998
Springer
A well-known framework by Fagin, Halpern, Moses and Vardi models knowledge-based agents as \Interpreted Systems". In this paper we analyse a particular class of interpreted sy...
128
click to vote
ISMIS
2000
Springer
15 years 5 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
118
click to vote
GOSLER
1995
15 years 5 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...