860 search results - page 104 / 172 » Lower Bounds on the Size of Test Data Sets |
SMA
2008
ACM
13 years 7 months ago
2008
ACM
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
FM
2001
Springer
14 years 11 days ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...
LREC
2008
13 years 9 months ago
2008
We discuss factors that affect human agreement on a semantic labeling task in the art history domain, based on the results of four experiments where we varied the number of labels...