Sciweavers

917 search results - page 25 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
80
Voted
ICCS
2005
Springer
15 years 3 months ago
Merge-Based Computation of Minimal Generators
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
Céline Frambourg, Petko Valtchev, Robert Go...
ICPR
2004
IEEE
15 years 10 months ago
Signal Discrimination Using a Support Vector Machine for Genetic Syndrome Diagnosis
In this study, a support vector machine (SVM) classifies real world data of cytogenetic signals measured from fluorescence in-situ hybridization (FISH) images in order to diagnose...
Amit David, Boaz Lerner
ISORC
2000
IEEE
15 years 2 months ago
Structural and Behavioral Decomposition in Object Oriented Models
The decomposition of large systems into parts is a general principle of software design. Even more, in the scope of distributed systems a partition of the whole system into distri...
Joachim Fischer, Eckhardt Holz, Birger Møll...
DASFAA
1993
IEEE
127views Database» more  DASFAA 1993»
15 years 1 months ago
An Object-Centered Data Model for Engineering Design Databases
: Entities in engineering design databases need to evolve in both structure and behavior. Such a need is not well addressed by object-oriented data models based on the class concep...
Huibin Zhao, Alexandros Biliris
101
Voted
FOCS
1996
IEEE
15 years 1 months ago
Fault Tolerant Data Structures
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...
Yonatan Aumann, Michael A. Bender