11211 search results - page 1793 / 2243 » Rank-Sensitive Data Structures |
168
click to vote
CF
2006
ACM
15 years 10 months ago
2006
ACM
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
161
click to vote
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
132
click to vote
ICDE
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Defining suitable indexes is a major task when optimizing a database. Usually, a human database administrator defines a set of indexes in the design phase of the data...
152
Voted
INFOVIS
2005
IEEE
15 years 10 months ago
2005
IEEE
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
143
click to vote
WISE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...