Sciweavers

2924 search results - page 249 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICCI
1993
15 years 8 months ago
Interval-Set Algebra for Qualitative Knowledge Representation
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a c...
Y. Y. Yao
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 7 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
AUTOMATICA
2007
68views more  AUTOMATICA 2007»
15 years 4 months ago
Frequency domain maximum likelihood estimation of linear dynamic errors-in-variables models
- This paper studies the linear dynamic errors-in-variables problem in the frequency domain. First the identifiability is shown under relaxed conditions. Next a frequency domain Ga...
Rik Pintelon, Johan Schoukens
77
Voted
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 4 months ago
Polygon Exploration with Discrete Vision
With the advent of autonomous robots with two- and three-dimensional scanning capabilities, classical visibility-based exploration methods from computational geometry have gained ...
Sándor P. Fekete, Christiane Schmidt
IDA
2007
Springer
15 years 3 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando