Sciweavers

2487 search results - page 141 / 498
» Partitions of Graphs into Trees
Sort
View
138
Voted
DOLAP
1998
ACM
15 years 7 months 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
119
Voted
CORR
2006
Springer
84views Education» more  CORR 2006»
15 years 3 months ago
PLTL Partitioned Model Checking for Reactive Systems under Fairness Assumptions
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
Samir Chouali, Jacques Julliand, Pierre-Alain Mass...
102
Voted
DAM
2007
78views more  DAM 2007»
15 years 3 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin
79
Voted
ML
2002
ACM
135views Machine Learning» more  ML 2002»
15 years 3 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...
145
Voted
VLSID
2005
IEEE
97views VLSI» more  VLSID 2005»
15 years 9 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