Sciweavers

688 search results - page 81 / 138
» Types for trees
Sort
View
108
Voted
DCC
2007
IEEE
16 years 3 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...
104
Voted
ICC
2009
IEEE
159views Communications» more  ICC 2009»
15 years 10 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
COMPUTER
1998
131views more  COMPUTER 1998»
15 years 3 months ago
Windows NT Clustering Service
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
Rod Gamache, Rob Short, Mike Massa
177
Voted
PR
2011
14 years 6 months ago
Hierarchical annotation of medical images
In this paper, we describe an approach for the automatic medical annotation task of the 2008 CLEF cross-language image retrieval campaign (ImageCLEF). The data comprise 12076 full...
Ivica Dimitrovski, Dragi Kocev, Suzana Loskovska, ...
101
Voted
DM
1998
60views more  DM 1998»
15 years 3 months ago
On numbers of Davenport-Schinzel sequences
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
Martin Klazar