Sciweavers

3367 search results - page 397 / 674
» Incremental assignment problem
Sort
View
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
16 years 6 months ago
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu
VIS
2004
IEEE
178views Visualization» more  VIS 2004»
16 years 6 months ago
Depth Enhanced Panoramas
Depth enhanced panoramas are a practical solution to the difficult problem of inside-looking-out modeling. Depth enhanced panoramas extend color panoramas to support viewpoint tra...
Gleb Bahmutov, Voicu Popescu, Elisha Sacks
DAC
2005
ACM
16 years 5 months ago
Power optimal dual-Vdd buffered tree considering buffer stations and blockages
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
King Ho Tam, Lei He
143
Voted
MICCAI
2005
Springer
16 years 5 months ago
Efficient Learning by Combining Confidence-Rated Classifiers to Incorporate Unlabeled Medical Data
Abstract. In this paper, we propose a new dynamic learning framework that requires a small amount of labeled data in the beginning, then incrementally discovers informative unlabel...
Weijun He, Xiaolei Huang, Dimitris N. Metaxas, Xia...
ICML
2009
IEEE
16 years 5 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis