9405 search results - page 1020 / 1881 » Computing a Model of Set Theory |
202
click to vote
DAC
1997
ACM
15 years 11 months ago
1997
ACM
The biggest obstacle in the formal verification of large designs is their very large state spaces, which cannot be handled even by techniques such as implicit state space travers...
174
click to vote
VIS
2005
IEEE
16 years 8 months ago
2005
IEEE
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
198
click to vote
COLT
1997
Springer
15 years 11 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
202
click to vote
ICDT
2010
ACM
15 years 6 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
207
click to vote
ICDE
1993
IEEE
15 years 11 months ago
1993
IEEE
To add time su port to the relational model, both first normal form (fNF and non-INF appmches have maining within 1NF when time support is added may introduce data redundancy. The...