Sciweavers

5981 search results - page 463 / 1197
» time 2006
Sort
View
144
Voted
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 6 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 6 months ago
Minimizing Symmetric Set Functions Faster
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
Michael Brinkmeier
178
Voted
CSDA
2006
155views more  CSDA 2006»
15 years 6 months ago
Modelling the mean of a doubly stochastic Poisson process by functional data analysis
A new procedure for estimating the mean process of a doubly stochastic Poisson process is introduced. The proposed estimation is based on monotone piecewise cubic interpolation of...
P. R. Bouzas, Mariano J. Valderrama, Ana M. Aguile...
187
Voted
CSL
2006
Springer
15 years 6 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
DAM
2006
97views more  DAM 2006»
15 years 6 months ago
Fully dynamic recognition algorithm and certificate for directed cographs
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
Christophe Crespelle, Christophe Paul