Sciweavers

4302 search results - page 34 / 861
» Index Pairs Algorithms
Sort
View
ICDIM
2008
IEEE
14 years 2 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
CIE
2009
Springer
14 years 2 months ago
Index Sets and Universal Numberings
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...
Sanjay Jain, Frank Stephan, Jason Teutsch
RAS
2000
130views more  RAS 2000»
13 years 7 months ago
Allocating optimal index positions on tool magazines using genetic algorithms
This paper presents an optimisation system software developed for the determination of optimal index positions of cutting tools on the automatic tool changer (ATC) or turret magaz...
Türkay Dereli, I. Hüseyin Filiz
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 9 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 6 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna