3229 search results - page 206 / 646 » The Theory of Timed Automata |
169
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
174
click to vote
ENTCS
2002
15 years 6 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
174
click to vote
MICCAI
2004
Springer
16 years 7 months ago
2004
Springer
Abstract. Often in neurosurgical planning a dual spin echo acquisition is performed that yields proton density (PD) and T2-weighted images to evaluate edema near a tumor or lesion....
197
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
179
click to vote
MIE
2008
15 years 8 months ago
2008
In the United States and Europe, electronic health records (EHRs) allow information technology and decision-support to facilitate the activities of clinicians and are considered a...