Sciweavers

1507 search results - page 186 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
WEBDB
2005
Springer
100views Database» more  WEBDB 2005»
14 years 3 months ago
Malleable Schemas: A Preliminary Report
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...
Xin Dong, Alon Y. Halevy
LICS
2007
IEEE
14 years 4 months ago
The Cost of Punctuality
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
ITSSA
2006
89views more  ITSSA 2006»
13 years 10 months ago
A Methodology for Classifying Self-Organizing Software Systems
: The software industry is faced with the fast growing complexity of IT infrastructures. This makes manual administration increasingly difficult and appears to be the limiting fact...
Klaus Herrmann, Matthias Werner, Gero Mühl
BIBM
2007
IEEE
130views Bioinformatics» more  BIBM 2007»
14 years 4 months ago
Analysis of Protein Protein Dimeric Interfaces
We analyzed the structural properties and the local surface environment of surface amino acid residues of proteins using a large, non-redundant dataset of 2383 protein chains in d...
Feihong Wu, Fadi Towfic, Drena Dobbs, Vasant Honav...
COCOON
2001
Springer
14 years 2 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu