1314 search results - page 163 / 263 » Approximate data mining in very large relational data |
140
click to vote
DIS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
162
click to vote
IWCIA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
140
click to vote
DL
1998
Springer
15 years 8 months ago
1998
Springer
This paper describes an agent-assisted approach to the construction of floristic digital libraries, which consist of very large botanical data repositories and related services. W...
120
click to vote
VISUALIZATION
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper discusses techniques for extracting feature lines from three-dimensional unstructured grids. Our twin objectives are to facilitate the interactive manipulation of these...
150
click to vote
ACL
2009
15 years 2 months ago
2009
This paper presents a system for querying treebanks. The system consists of a powerful query language with natural support for cross-layer queries, a client interface with a graph...