Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,714
The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries
, 1997
"... Recently, similarity queries on feature vectors have been widely used to perform content-based retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor queries e ciently. The SS-tree had been proposed for ..."
Abstract
-
Cited by 438 (3 self)
- Add to MetaCart
and non-uniform data which can be practical in actual image/video similarity indexing. We include the performance test results that verify this advantage of the SR-tree and show that the SR-tree outperforms both the SS-tree and the R*-tree.
The iSLIP Scheduling Algorithm for Input-Queued Switches
, 1999
"... An increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a switched backplane based on a crossbar switch. Most often, these systems use input queues to hold packets waiting to traverse the switching fabric. It is well known th ..."
Abstract
-
Cited by 425 (8 self)
- Add to MetaCart
, round-robin algorithm, iSLIP can achieve 100% throughput for uniform traffic, yet is simple to implement in hardware. Iterative and noniterative versions of the algorithms are presented, along with modified versions for prioritized traffic. Simulation results are presented to indicate the performance
Support Vector Machines for Classification and Regression
- UNIVERSITY OF SOUTHAMPTON, TECHNICAL REPORT
, 1998
"... The problem of empirical data modelling is germane to many engineering applications.
In empirical data modelling a process of induction is used to build up a model of the
system, from which it is hoped to deduce responses of the system that have yet to be observed.
Ultimately the quantity and qualit ..."
Abstract
-
Cited by 357 (5 self)
- Add to MetaCart
and quality of the observations govern the performance
of this empirical model. By its observational nature data obtained is finite and sampled;
typically this sampling is non-uniform and due to the high dimensional nature of the
problem the data will form only a sparse distribution in the input space
ON THE NON-UNIFORM COMPLEXITY OF BRAIN CONNECTIVITY
, 2007
"... A stratification and manifold learning approach for analyzing High Angular Resolution Diffusion Imaging (HARDI) data is introduced in this paper. HARDI data provides highdimensional signals measuring the complex microstructure of biological tissues, such as the cerebral white matter. We show that th ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
that these high-dimensional spaces may be understood as unions of manifolds of varying dimensions/complexity and densities. With such analysis, we use clustering to characterize the structural complexity of the white matter. We briefly present the underlying framework and numerical experiments illustrating
Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves
- IEEE Transactions on Parallel and Distributed Systems
, 1995
"... We discuss Inverse Spacefilling Partitioning (ISP), a partitioning strategy for nonuniform scientific computations running on distributed memory MIMD parallel computers. We consider the case of a dynamic workload distributed on a uniform mesh, and compare ISP against Orthogonal Recursive Bisectio ..."
Abstract
-
Cited by 63 (2 self)
- Add to MetaCart
We discuss Inverse Spacefilling Partitioning (ISP), a partitioning strategy for nonuniform scientific computations running on distributed memory MIMD parallel computers. We consider the case of a dynamic workload distributed on a uniform mesh, and compare ISP against Orthogonal Recursive
Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets
- In Proceedings of the 9th ACM Int. Conf. on Information and Knowledge Management
, 2000
"... With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based technique called VA-file has been proposed for indexing high dimensional data. It has been shown that the VA-file is an effective ..."
Abstract
-
Cited by 15 (3 self)
- Add to MetaCart
sets are usually correlated. More careful analysis for nonuniform or correlated data is needed for effectively indexing high dimensional data. We propose a solution to these problems and propose the VA+-file, a new technique for indexing high dimensional data sets based on vector approximations. We
Non-uniformly expanding 1D maps
- Commun. Math. Phys
"... Abstract This paper attmpts to make accessible a body of ideas surrounding the follow-ing result: Typical families of (possibly multimodal) 1-dimensional maps passing through “Misiurewicz points ” have invariant densities for positive measure sets of parameters. The simplest paradigms of chaotic beh ..."
Abstract
-
Cited by 11 (7 self)
- Add to MetaCart
behavior in dynamical systems are found in uniformly expanding and uniformly hyperbolic (or Anosov) maps. Allowing expanding and contracting behaviors to mix leads to a multitude of new possibilities. In spite of much progress, the analysis of most nonuniformly hyperbolic systems has remained hopelessly
Constellation mappings for two-dimensional signaling of non-uniform sources
- IEEE Trans. Commun
, 2003
"... Abstract—The design of two-dimensional constellation mappings for the transmission of binary nonuniform memoryless sources over additive white Gaussian noise channels using standard-ary PSK and QAM modulation schemes is investigated. The main application of this problem is the incorporation of an ad ..."
Abstract
-
Cited by 15 (6 self)
- Add to MetaCart
Abstract—The design of two-dimensional constellation mappings for the transmission of binary nonuniform memoryless sources over additive white Gaussian noise channels using standard-ary PSK and QAM modulation schemes is investigated. The main application of this problem is the incorporation
A criterion for ergodicity of non-uniformly hyperbolic diffeomorphisms
"... Abstract. In this work we exhibit a new criteria for ergodicity of diffeomorphisms involving conditions on Lyapunov exponents and general position of some invariant manifolds. On one hand we derive uniqueness of SRB-measures for transitive surface diffeomorphisms. On the other hand, using recent res ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
results on the existence of blenders we give a positive answer, in the C1 topology, to a conjecture of Pugh-Shub in the context of partially hyperbolic conservative diffeomorphisms with two dimensional center bundle. 1.
De-aliasing on non-uniform grids: algorithms and applications
, 2003
"... We present de-aliasing rules to be used when evaluating non-linear terms with polynomial spectral methods on nonuniform grids analogous to the de-aliasing rules used in Fourier spectral methods. They are based upon the idea of super-collocation followed by a Galerkin projection of the non-linear ter ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
We present de-aliasing rules to be used when evaluating non-linear terms with polynomial spectral methods on nonuniform grids analogous to the de-aliasing rules used in Fourier spectral methods. They are based upon the idea of super-collocation followed by a Galerkin projection of the non
Results 1 - 10
of
1,714
