1431 search results - page 130 / 287 » The complexity of random ordered structures |
131
click to vote
EDBTW
2010
Springer
15 years 1 months ago
2010
Springer
Spatial data warehouses (SDW) rely on extended multidimensional (MD) models in order to provide decision makers with appropriate structures to intuitively analyse spatial data. Se...
116
click to vote
MICCAI
2002
Springer
16 years 4 months ago
2002
Springer
A framework is proposed for the segmentation of brain tumors from MRI. Instead of training on pathology, the proposed method trains exclusively on healthy tissue. The algorithm att...
126
click to vote
WG
1993
Springer
15 years 7 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
123
click to vote
TON
2002
15 years 2 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
122
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Many applications of spoken-language systems can benefit from having access to annotations of prosodic events. Unfortunately, obtaining human annotations of these events, even se...