Sciweavers

11231 search results - page 364 / 2247
» Digging for Data Structures
Sort
View
SSDBM
2007
IEEE
107views Database» more  SSDBM 2007»
16 years 1 months ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
Brendan Elliott, Suleyman Fatih Akgul, Stephen May...
OTM
2005
Springer
16 years 8 days ago
Mapping Discovery for XML Data Integration
Abstract. The interoperability of heterogeneous data sources is an important issue in many applications such as mediation systems or web-based systems. In these systems, each data ...
Zoubida Kedad, Xiaohui Xue
176
Voted
ECML
2001
Springer
15 years 11 months ago
Discovering Admissible Simultaneous Equation Models from Observed Data
Conventional work on scienti c discovery such as BACON derives empirical law equations from experimental data. In recent years, SDS introducing mathematical admissibility constrain...
Takashi Washio, Hiroshi Motoda, Yuji Niwa
APPINF
2003
15 years 8 months ago
A Comparison of Structure-generic Relational Storage Schemes of XML Data
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
Weining Zhang, Douglas Pollok
FOIKS
2010
Springer
15 years 4 months ago
Two Complementary Classification Methods for Designing a Concept Lattice from Interval Data
This paper holds on the application of two classification methods based on formal concept analysis (FCA) to interval data. The first method uses a similarity between objects while ...
Mehdi Kaytoue-Uberall, Zainab Assaghir, Nizar Mess...