Sciweavers

8497 search results - page 1568 / 1700
» Design for an Optimal Probe
Sort
View
SIGMOD
2009
ACM
165views Database» more  SIGMOD 2009»
15 years 2 months ago
Query by output
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in t...
Quoc Trung Tran, Chee-Yong Chan, Srinivasan Partha...
FOCS
2000
IEEE
15 years 2 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
DEXA
2000
Springer
132views Database» more  DEXA 2000»
15 years 2 months ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
PODC
1999
ACM
15 years 2 months ago
Memory Space Requirements for Self-Stabilizing Leader Election Protocols
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
FPGA
1999
ACM
174views FPGA» more  FPGA 1999»
15 years 2 months ago
Reduction of Latency and Resource Usage in Bit-Level Pipelined Data Paths for FPGAs
Pipelining of data path structures increases the throughput rate at the expense of enlarged resource usage and latency unless architectures optimized towards specific applications...
Peter Kollig, Bashir M. Al-Hashimi
« Prev « First page 1568 / 1700 Last » Next »