Sciweavers

7820 search results - page 185 / 1564
» Formalization of Time and Space
Sort
View
140
Voted
FOCS
2003
IEEE
16 years 12 days ago
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
ALT
2004
Springer
16 years 4 months ago
Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
Steffen Lange, Sandra Zilles
SAC
2010
ACM
16 years 1 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
BMCBI
2010
178views more  BMCBI 2010»
15 years 7 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
ICCS
1999
Springer
15 years 11 months ago
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...
Guy W. Mineau, Gerd Stumme, Rudolf Wille