نتایج جستجو برای: nearest interval approximation

تعداد نتایج: 420774  

2014
Stephen Gould Jiecheng Zhao Xuming He Yuhang Zhang

We present a fast approximate nearest neighbor algorithm for semantic segmentation. Our algorithm builds a graph over superpixels from an annotated set of training images. Edges in the graph represent approximate nearest neighbors in feature space. At test time we match superpixels from a novel image to the training images by adding the novel image to the graph. A move-making search algorithm a...

Journal: :SIAM J. Matrix Analysis Applications 2003
Moody T. Chu Robert J. Plemmons

Partially due to the fact that the empirical data collected by devices with finite bandwidth often neither preserves the specified structure nor induces a certain desired rank, retrieving the nearest structured low rank approximation from a given data matrix becomes an imperative task in many applications. This paper investigates the case of approximating a given target matrix by a real-valued ...

Journal: :Engineering Letters 2008
Imane Daoudi Saïd El Alaoui Ouatik A. El Kharraz Khalid Idrissi Driss Aboutajdine

the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexing method for high-dimensional multimedia databases using the filtering approach, known also as vector approximation approach which supports the nearest neighbor search efficiently. Our technique called RA +-Blocks (Region...

2017
Haukur Pálmason Björn Þór Jónsson Laurent Amsaleg Markus Schedl Peter Knees

The traditional role of nearest-neighbor classification in music classification research is that of a straw man opponent for the learning approach of the hour. Recent work in high-dimensional indexing has shown that approximate nearest-neighbor algorithms are extremely scalable, yielding results of reasonable quality from billions of highdimensional features. With such efficient large-scale cla...

1999
Sakti Pramanik Scott Alexander Jinhua Li

In this papel; we present an approximate nearest neighbor search algorithm that use heuristics to decide whether o r not to access a node in the index tree based on three interesting data distribution properties. We demonstrate that the proposed algorithm significantly reduces the number of nodes accessed over the algorithms that have been proposed in earlier works. Also, it will be demonstrate...

2014
Roumen Anguelov Svetoslav Markov

The set of interval Hausdorff continuous functions constitutes the largest space preserving basic algebraic and topological structural properties of continuous functions, such as linearity, ring structure, Dedekind order completeness, etc. Spaces of interval functions have important applications not only in the construction of numerical methods and algorithms, but to problems in abstract areas ...

1999
Marcus Klein Lars Nielsen

In model-based diagnosis the problem of finding all the relations that can be used to detect and isolate different faults, is solved for linear systems. However, for nonlinear systems the situation is more complicated. Here an approach will be taken using a linear method together with gain scheduling. Linear residual generators are designed at a number of stationary points. The approach is base...

Journal: :Bulletin of the American Mathematical Society 1983

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید