778 search results - page 98 / 156 » Modelling a Query Space Using Associations |
111
click to vote
ITCC
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose a novel, computationally efficient generative topographic model for inferring low dimensional representations of high dimensional data sets, designed to exploit data s...
113
click to vote
ESAW
2009
Springer
15 years 8 months ago
2009
Springer
As the number of information in the Internet constantly increases and the complexity of systems rapidly grows, locating and manipulating complex data has become a difficult task. W...
149
click to vote
IADT
1998
15 years 3 months ago
1998
Conventional image processing algorithms used to compare images are very timeconsuming, making them inappropriate for use in searching for an image in a huge collection of images ...
137
click to vote
SPIRE
2010
Springer
15 years 10 days ago
2010
Springer
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
195
click to vote
ICDE
1999
IEEE
16 years 3 months ago
1999
IEEE
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...