Sciweavers

1507 search results - page 59 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
AI
2003
Springer
14 years 3 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
CSR
2007
Springer
14 years 4 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
ICIP
2002
IEEE
14 years 11 months ago
Retrieval of 3D protein structures
A protein molecule is made of a long chain of amino acid sequences that fold into a complex three-dimensional structure. It is often the geometrical shapes that determine the prot...
Shann-Ching Chen, Tsuhan Chen
ICFP
2010
ACM
13 years 11 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
ACTAC
1998
71views more  ACTAC 1998»
13 years 9 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene