Sciweavers

900 search results - page 72 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
BMCBI
2010
205views more  BMCBI 2010»
13 years 9 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...
INFOCOM
2002
IEEE
14 years 1 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
AAAI
2006
13 years 10 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
AFPAC
2000
Springer
341views Mathematics» more  AFPAC 2000»
14 years 1 months ago
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
Gösta H. Granlund
AI
2010
Springer
13 years 9 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel