Sciweavers

1601 search results - page 215 / 321
» Closed Sets for Labeled Data
Sort
View
VLDB
1990
ACM
179views Database» more  VLDB 1990»
15 years 10 months ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish
DEXA
2008
Springer
85views Database» more  DEXA 2008»
15 years 8 months ago
Reordering of Location Identifiers for Indexing an RFID Tag Object Database
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...
Sungwoo Ahn, Bonghee Hong
JANCL
2006
123views more  JANCL 2006»
15 years 6 months ago
Approximate databases: a support tool for approximate reasoning
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...
Patrick Doherty, Martin Magnusson, Andrzej Szalas
ACTA
2002
111views more  ACTA 2002»
15 years 6 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
JSA
1998
74views more  JSA 1998»
15 years 6 months ago
Windowed active sampling for reliable neural learning
The composition of the example set has a major impact on the quality of neural learning. The popular approach is focused on extensive preprocessing to bridge the representation ga...
Emilia I. Barakova, Lambert Spaanenburg