8728 search results - page 424 / 1746 » On Reduct Construction Algorithms |
172
click to vote
CGI
2001
IEEE
15 years 10 months ago
2001
IEEE
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
143
click to vote
ICSE
2003
IEEE-ACM
16 years 7 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
164
click to vote
IFIP
2004
Springer
16 years 7 days ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
170
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
222
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents thei...