11211 search results - page 1746 / 2243 » Rank-Sensitive Data Structures |
181
click to vote
ACSC
2000
IEEE
15 years 9 months ago
2000
IEEE
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for...
131
click to vote
ASYNC
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper introduces several new asynchronous pipeline designs which offer high throughput as well as low latency. The designs target dynamic datapaths, both dualrail as well as ...
165
click to vote
DCC
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding o...
173
click to vote
SCCC
2000
IEEE
15 years 9 months ago
2000
IEEE
Knowledge discovery is the most desirable end product of an enterprise information system. Researches from different areas recognize that a new generation of intelligent tools for...
131
Voted
SSDBM
2000
IEEE
15 years 9 months ago
2000
IEEE
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize giv...