Sciweavers

1150 search results - page 173 / 230
» Note from the Editor
Sort
View
JCT
2006
77views more  JCT 2006»
13 years 7 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen
JIIS
2006
103views more  JIIS 2006»
13 years 7 months ago
Time-focused clustering of trajectories of moving objects
Spatio-temporal, geo-referenced datasets are growing rapidly, and will be more in the near future, due to both technological and social/commercial reasons. From the data mining vie...
Mirco Nanni, Dino Pedreschi
JSAC
2006
84views more  JSAC 2006»
13 years 7 months ago
The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks
A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new con...
Wojciech Kabacinski, Marek Michalski
FMSD
2007
101views more  FMSD 2007»
13 years 7 months ago
Timed substitutions for regular signal-event languages
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
Béatrice Bérard, Paul Gastin, Antoin...
RSA
2006
74views more  RSA 2006»
13 years 7 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan