Sciweavers

455 search results - page 30 / 91
» On Trees and Noncrossing Partitions
Sort
View
ISCAS
1999
IEEE
124views Hardware» more  ISCAS 1999»
14 years 2 days ago
On the robustness of vector set partitioning image coders to bit errors
A vector enhancement of Said and Pearlman's Set Partitioning in Hierarchical Trees (SPIHT) methodology, named VSPIHT, has recently been proposed for embedded wavelet image co...
D. Mukherjee, S. K. Mitra
DOLAP
1998
ACM
14 years 1 days ago
Dynamic Maintenance of Multidimensional Range Data Partitioning for Parallel Data Processing
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
Junping Sun, William I. Grosky
ML
2002
ACM
135views Machine Learning» more  ML 2002»
13 years 7 months ago
Bayesian Treed Models
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
Hugh A. Chipman, Edward I. George, Robert E. McCul...
VLSID
2005
IEEE
97views VLSI» more  VLSID 2005»
14 years 1 months ago
Q-PREZ: QBF Evaluation Using Partition, Resolution and Elimination with ZBDDs
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
Kameshwar Chandrasekar, Michael S. Hsiao
SC
2003
ACM
14 years 1 months ago
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
George Karypis