Results 1  10
of
683
Efficient collision detection using bounding volume hierarchies of kdops
 IEEE Transactions on Visualization and Computer Graphics
, 1998
"... Abstract—Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment ..."
Abstract

Cited by 290 (4 self)
 Add to MetaCart
volume hierarchies, for efficient collision detection for objects moving within highly complex environments. Our choice of bounding volume is to use a “discrete orientation polytope” (“kdop”), a convex polytope whose facets are determined by halfspaces whose outward normals come from a small fixed set of k
Clustering by compression
 IEEE Transactions on Information Theory
, 2005
"... Abstract—We present a new method for clustering based on compression. The method does not use subjectspecific features or background knowledge, and works as follows: First, we determine a parameterfree, universal, similarity distance, the normalized compression distance or NCD, computed from the l ..."
Abstract

Cited by 297 (25 self)
 Add to MetaCart
developed by one of the authors, is provably optimal. However, the optimality comes at the price of using the noncomputable notion of Kolmogorovcomplexity. We propose axioms to capture the realworld setting, and show that the NCD approximates optimality. To extract a hierarchy of clusters from the distance matrix
A New Solution to the Coherence Problems in Multicache Systems
 IEEE Transactions on Computers
, 1987
"... AbstractA memory hierarchy has coherence problems as sooncontents of the main memoryis copied in thecache. One as one of its levels is split in several independent unitswhich are not says that such a datumis present in the cache. If a processor p^ilarl adonauMla frnw factor lnwale nr nrd%d ..."
Abstract

Cited by 256 (1 self)
 Add to MetaCart
ofthis solution is that it is possible, in a cachemain memory subsystem, to delay updating the main memory until a block is needed in the cache (nonstorethrough mode of operation). Index TermsCaches, coherence, memory hierarchy, multiprocessor systems, nonstorethrough. I.
Contextbased adaptive binary arithmetic coding in the h.264/avc video compression standard. Circuits and Systems for VideoTechnology, IEEETransactions on
"... (CABAC) as a normative part of the new ITUT/ISO/IEC standard H.264/AVC for video compression is presented. By combining an adaptive binary arithmetic coding technique with context modeling, a high degree of adaptation and redundancy reduction is achieved. The CABAC framework also includes a novel l ..."
Abstract

Cited by 213 (12 self)
 Add to MetaCart
lowcomplexity method for binary arithmetic coding and probability estimation that is well suited for efficient hardware and software implementations. CABAC significantly outperforms the baseline entropy coding method of H.264/AVC for the typical area of envisaged target applications. For a set
Indexdriven similarity search in metric spaces
 ACM Transactions on Database Systems
, 2003
"... Similarity search is a very important operation in multimedia databases and other database applications involving complex objects, and involves finding objects in a data set S similar to a query object q, based on some similarity measure. In this article, we focus on methods for similarity search th ..."
Abstract

Cited by 192 (8 self)
 Add to MetaCart
that make the general assumption that similarity is represented with a distance metric d. Existing methods for handling similarity search in this setting typically fall into one of two classes. The first directly indexes the objects based on distances (distancebased indexing), while the second is based
Index sets for computable structures
 Algebra and Logic, 353:491 – 518
, 2001
"... Abstract The index set of a computable structure A is the set of all indices for computable isomorphic copies of A. We determine, using the arithmetical hierarchy and the difference hierarchy, the exact complexity of the index sets of structures within the following classes of structures: finite st ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract The index set of a computable structure A is the set of all indices for computable isomorphic copies of A. We determine, using the arithmetical hierarchy and the difference hierarchy, the exact complexity of the index sets of structures within the following classes of structures: finite
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy
 Journal of Computer and System Sciences
, 1995
"... . In this paper we show how to construct for every set R of integers in the arithmetical hierarchy a dynamical system H with piecewiseconstant derivatives (PCD) such that deciding membership in R can be reduced to solving the reachability problem between two rational points for H. The ability of ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
. In this paper we show how to construct for every set R of integers in the arithmetical hierarchy a dynamical system H with piecewiseconstant derivatives (PCD) such that deciding membership in R can be reduced to solving the reachability problem between two rational points for H. The ability
Fuzzy logic and arithmetical hierarchy III.
"... Fuzzy logic is understood as a logic with a comparative and truthfunctional notion of truth. Arithmetical complexity of sets of tautologies (identically true sentences) and satisfiable sentences (sentences true in at least one interpretation) as well of sets of provable formulas of the most impo ..."
Abstract
 Add to MetaCart
Fuzzy logic is understood as a logic with a comparative and truthfunctional notion of truth. Arithmetical complexity of sets of tautologies (identically true sentences) and satisfiable sentences (sentences true in at least one interpretation) as well of sets of provable formulas of the most
Degrees of Categoricity and the Hyperarithmetic Hierarchy
 JOURNAL OF FORMAL LOGIC
, 2011
"... We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of Fokina, Kalimullin, and R. Miller to show that for every computable ordinal α, 0 (α) is the degree of categoricity of some computable structure A. We show additionally that for α a computable successor ordinal, ev ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
, every degree 2c.e. in and above 0 (α) is a degree of categoricity. We further prove that every degree of categoricity is hyperarithmetic and show that the index set of structures with degrees of categoricity is Π 1 1 complete.
BitSliced Index Arithmetic
 In SIGMOD
, 2001
"... The bitsliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how to efficiently generate new BSI's Z, V, and W, such that Z = X + Y, V = X  Y, and W = MIN(X, Y); this means that if ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
that if a row r in T has a value x represented in BSI X and a value y in BSI Y, the value for r i n BSI Z will be x + y, the value in V will be x  y and the value i n W will be MIN(x, y). Since a bitmap representing a set of rows is the simplest bitsliced index, BSI arithmetic is the most straightforward
Results 1  10
of
683