Results 11  20
of
4,546
BrepIndex: A Multidimensional Space Partitioning Tree
, 1991
"... In this paper we present the Brepindex, a multidimensional space partitioning data structure that provides quick spatial access to the vertices, edges and faces of a boundary representation (Brep), thus yielding a single unified representation for polyhedral solids. We give an algorithm for the con ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
In this paper we present the Brepindex, a multidimensional space partitioning data structure that provides quick spatial access to the vertices, edges and faces of a boundary representation (Brep), thus yielding a single unified representation for polyhedral solids. We give an algorithm
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
 International Journal of Computer Vision
, 2001
"... In this paper, we propose a computational model of the recognition of real world scenes that bypasses the segmentation and the processing of individual objects or regions. The procedure is based on a very low dimensional representation of the scene, that we term the Spatial Envelope. We propose a se ..."
Abstract

Cited by 1313 (81 self)
 Add to MetaCart
set of perceptual dimensions (naturalness, openness, roughness, expansion, ruggedness) that represent the dominant spatial structure of a scene. Then, we show that these dimensions may be reliably estimated using spectral and coarsely localized information. The model generates a multidimensional space
Optimal Interpolatory Subdivision Schemes in Multidimensional Spaces
 SIAM J. Numer. Anal
, 1997
"... . We analyse the approximation and smoothness properties of fundamental and refinable functions that arise from interpolatory subdivision schemes in multidimensional spaces. In particular, we provide a general way for the construction of bivariate interpolatory refinement masks such that the corresp ..."
Abstract

Cited by 25 (19 self)
 Add to MetaCart
. We analyse the approximation and smoothness properties of fundamental and refinable functions that arise from interpolatory subdivision schemes in multidimensional spaces. In particular, we provide a general way for the construction of bivariate interpolatory refinement masks
Zooming and Tunneling in Tioga: Supporting Navigation in Multidimensional Space
"... In [7] we proposed a visual programming system called Tioga. The Tioga system applies a boxes and arrows programming notation to allow nonexpert users to graphically construct database applications. Users connect database procedures using a dataflow model. Browsers are used to visualize the resultin ..."
Abstract
 Add to MetaCart
the resulting data. This paper describes extensions to the Tioga browser protocol. These extensions allow sophisticated, flightsimulator navigation through a multidimensional data space. This design also incorporates wormholes to allow tunneling between different multidimensional spaces. Wormholes are shown
Rtrees: A Dynamic Index Structure for Spatial Searching
 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1984
"... In order to handle spatial data efficiently, as required in computer aided design and geodata applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data ..."
Abstract

Cited by 2750 (0 self)
 Add to MetaCart
to data objects of nonzero size located m multidimensional spaces In this paper we describe a dynamic index structure called an Rtree which meets this need, and give algorithms for searching and updating it. We present the results of a series of tests which indicate that the structure performs well
The algorithmic analysis of hybrid systems
 THEORETICAL COMPUTER SCIENCE
, 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract

Cited by 778 (71 self)
 Add to MetaCart
to linear hybrid systems. In particular, we consider symbolic modelchecking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We
Fast subsequence matching in timeseries databases
 PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1994
"... We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract

Cited by 533 (24 self)
 Add to MetaCart
We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature
BIRCH: an efficient data clustering method for very large databases
 In Proc. of the ACM SIGMOD Intl. Conference on Management of Data (SIGMOD
, 1996
"... Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters, or deusel y populated regions, in a multidir nensional clataset. Prior work does not adequately address the problem of ..."
Abstract

Cited by 576 (2 self)
 Add to MetaCart
multidimensional metric data points to try to produce the best quality clustering with the available resources (i. e., available memory and time constraints). BIRCH can typically find a goocl clustering with a single scan of the data, and improve the quality further with a few aclditioual scans. BIRCH
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 548 (1 self)
 Add to MetaCart
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like
Adaptive Piecewiseconstant Modeling of Signals in Multidimensional Spaces
"... This contribution describes an analysis method for the class of problems in which data elements – e.g. measurements, event detections, etc. – are distributed over some region of space and/or time, or other coordinates (e.g., energy, redshift, category), with the goal of estimating the variation of s ..."
Abstract
 Add to MetaCart
This contribution describes an analysis method for the class of problems in which data elements – e.g. measurements, event detections, etc. – are distributed over some region of space and/or time, or other coordinates (e.g., energy, redshift, category), with the goal of estimating the variation
Results 11  20
of
4,546