2254 search results - page 194 / 451 » Computing the minimal covering set |
150
click to vote
VLDB
2005
ACM
16 years 3 days ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
163
click to vote
DFT
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we propose a new concept of testing only functionally testable transition faults in Broadside Transition testing via a novel constrained ATPG. For each functionally...
136
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
179
click to vote
COLING
2000
15 years 8 months ago
2000
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
147
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constr...