8728 search results - page 49 / 1746 » On Reduct Construction Algorithms |
94
Voted
IMA
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, a study of a paradigm for domain expansion of MACs is generalized. In particular, a tradeoff between the efficiency of a MAC and the tightness of its security reduc...
91
Voted
STOC
2007
ACM
16 years 26 days ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
94
Voted
AAECC
1999
Springer
15 years 7 days ago
1999
Springer
Gr
101
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
85
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ...