Sciweavers

860 search results - page 122 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
14 years 1 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
GEOS
2007
Springer
14 years 1 months ago
Structure-Based Methods to Enhance Geospatial Ontology Alignment
In geospatial applications with heterogeneous classification schemes that describe related domains, an ontology-driven approach to data sharing and interoperability relies on the ...
William Sunna, Isabel F. Cruz
GIS
2006
ACM
14 years 8 months ago
Optimal BSPs and rectilinear cartograms
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
Mark de Berg, Elena Mumford, Bettina Speckmann
NAACL
1994
13 years 9 months ago
Multilingual Speech Databases at LDC
As multilingual products and technology grow in importance, the Linguistic Data Consortium (LDC) intends to provide the resources needed for research and development activities, e...
John J. Godfrey
ICALP
2001
Springer
14 years 6 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan