1403 search results - page 113 / 281 » Set cover algorithms for very large datasets |
150
click to vote
ROCAI
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents two new ways of example weighting for subgroup discovery. The proposed example weighting schemes are applicable to any subgroup discovery algorithm that uses th...
141
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...
121
click to vote
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Document decomposition is a basic but crucial step for many document related applications. This paper proposes a novel approach to decompose document images into zones. I...
187
click to vote
CRYPTO
2001
Springer
15 years 9 months ago
2001
Springer
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
136
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
With the emerging process variations in fabrication, the traditional corner-based timing optimization techniques become prohibitive. Buffer insertion is a very useful technique fo...