134 search results - page 23 / 27 » An Optimal Rebuilding Strategy for an Incremental Tree Probl... |
82
Voted
SIGMOD
1999
ACM
15 years 3 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
129
click to vote
CSCLP
2008
Springer
15 years 21 days ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
94
Voted
ICCAD
2003
IEEE
15 years 4 months ago
2003
IEEE
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
98
Voted
SIAMCOMP
2002
14 years 10 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
DIALM
2004
ACM
15 years 4 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...