6434 search results - page 426 / 1287 » The Dynamic Data Cube |
194
click to vote
TSMC
2010
15 years 1 months ago
2010
We study how the dependence of a simulation output on an uncertain parameter can be determined, when simulations are computationally expensive and so can only be run for very few p...
202
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
215
click to vote
COMCOM
2006
15 years 6 months ago
2006
The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in ...
160
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
199
click to vote
ML
2010
ACM
15 years 5 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...