31 search results - page 4 / 7 » Self-Concordant Barriers for Convex Approximations of Struct... |
PAKDD
2004
ACM
14 years 26 days ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
GIS
1999
ACM
13 years 11 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
ESA
2011
Springer
12 years 7 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
SIBGRAPI
2008
IEEE
14 years 1 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...