649 search results - page 20 / 130 » An Improved Construction of Progression-Free Sets |
MLDM
2009
Springer
15 years 4 months ago
2009
Springer
A number of two-class classification methods first discretize each attribute of two given training sets and then construct a propositional DNF formula that evaluates to True for ...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
84
Voted
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
SEMCO
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...