Sciweavers

1055 search results - page 163 / 211
» Enumerations in computable structure theory
Sort
View
PDIS
1996
IEEE
13 years 12 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
GD
2006
Springer
13 years 11 months ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle
EXACT
2007
13 years 10 months ago
A Discourse Approach to Explanation Aware Knowledge Representation
This study describes a discourse approach to explanation aware knowledge representation. It presents a reasoning model that adheres to argumentation as found in written discourse,...
Andrew Potter
UAI
2004
13 years 9 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
ISMB
2000
13 years 9 months ago
Intelligent Aids for Parallel Experiment Planning and Macromolecular Crystallization
This paper presents a framework called Parallel Experiment Planning (PEP) that is based on an abstraction of how experiments are performed in the domain of macromolecular crystall...
Vanathi Gopalakrishnan, Bruce G. Buchanan, John M....