Sciweavers

116 search results - page 18 / 24
» Estimating Compilation Time of a Query Optimizer
Sort
View
GECCO
2003
Springer
14 years 1 months ago
Efficiency and Reliability of DNA-Based Memories
Associative memories based on DNA-affinity have been proposed [2]. Here, the performance, efficiency, reliability of DNA-based memories is quantified through simulations in silico....
Max H. Garzon, Andrew Neel, Hui Chen
OOPSLA
2005
Springer
14 years 1 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
LCN
2008
IEEE
14 years 2 months ago
Efficient power management for Wireless Sensor Networks: A data-driven approach
—Providing energy-efficient continuous data collection services is of paramount importance to Wireless Sensor Network (WSN) applications. This paper proposes a new power manageme...
MingJian Tang, Jinli Cao, Xiaohua Jia
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 8 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
FOCS
2009
IEEE
14 years 2 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu