10293 search results - page 211 / 2059 » Describing Semistructured Data |
162
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
167
click to vote
VLDB
2002
ACM
15 years 4 months ago
2002
ACM
The duplicate elimination problem of detecting multiple tuples, which describe the same real world entity, is an important data cleaning problem. Previous domain independent solut...
130
click to vote
NLE
2007
15 years 4 months ago
2007
Natural Language Generation (NLG) can be used to generate textual summaries of numeric data sets. In this paper we develop an architecture for generating short (a few sentences) s...
202
click to vote
PTS
2010
15 years 2 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
150
click to vote
IJRR
2010
14 years 11 months ago
2010
This paper describes a data set collected by MIT's autonomous vehicle Talos during the 2007 DARPA Urban Challenge. Data from a high precision navigation system, 5 cameras, 12 ...