917 search results - page 68 / 184 » Comparison of Data Structures for Computing Formal Concepts |
ACSC
2002
IEEE
15 years 2 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
We present a novel multi-scale bone enhancement measure that can be used to drive a geometric flow to segment bone structures. This measure has the essential properties to be incor...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime inte...
UC
2009
Springer
15 years 4 months ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
TLCA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...