Sciweavers

673 search results - page 33 / 135
» Capturing both Types and Constraints in Data Integration
Sort
View
AIIA
2005
Springer
14 years 1 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
BMCBI
2008
116views more  BMCBI 2008»
13 years 7 months ago
Gene Ontology annotations: what they mean and where they come from
To address the challenges of information integration and retrieval, the computational genomics community increasingly has come to rely on the methodology of creating annotations o...
David P. Hill, Barry Smith, Monica S. McAndrews-Hi...
BIBE
2007
IEEE
148views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
A New Smoothing Model for Analyzing Array CGH Data
—Array based Comparative Genomic Hybridization (CGH) is a molecular cytogenetic method for the detection of chromosomal imbalances and it has been extensively used for studying c...
Nha Nguyen, Heng Huang, Soontorn Oraintara, An P. ...
WWW
2007
ACM
14 years 8 months ago
Bridging the gap between OWL and relational databases
Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constrai...
Boris Motik, Ian Horrocks, Ulrike Sattler
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan