14518 search results - page 2581 / 2904 » Two Problems for Sophistication |
168
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
194
click to vote
DAC
1997
ACM
15 years 11 months ago
1997
ACM
This paper examines the problem of statically analyzing the performance of embedded software. This problem is motivated by the increasing growth of embedded systems and a lack of ...
148
click to vote
SIGMOD
1996
ACM
15 years 11 months ago
1996
ACM
Materialized views and view maintenance are important for data warehouses, retailing, banking, and billing applications. We consider two related view maintenance problems: 1) how ...
180
click to vote
ICCAD
1993
IEEE
15 years 11 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
210
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...