Sciweavers

4536 search results - page 300 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
DBPL
1999
Springer
102views Database» more  DBPL 1999»
15 years 11 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce
GIS
2004
ACM
16 years 7 months ago
A new approach for a topographic feature-based characterization of digital elevation data
Triangular Irregular Network (TIN) and Regular Square Grid (RSG) are widely used for representing 2.5 dimensional spatial data. However, these models are not defined from the topo...
Eric Saux, Ki-Joune Li, Min-Hwan Kim, Rémy ...
JCDL
2006
ACM
151views Education» more  JCDL 2006»
16 years 20 days ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
ISAAC
2004
Springer
84views Algorithms» more  ISAAC 2004»
16 years 2 days ago
Property-Preserving Data Reconstruction
We initiate a new line of investigation into online property-preserving data reconstruction. Consider a dataset which is assumed to satisfy various (known) structural properties; e...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
JMLR
2000
134views more  JMLR 2000»
15 years 6 months ago
Learning with Mixtures of Trees
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
Marina Meila, Michael I. Jordan