2370 search results - page 298 / 474 » The Characterization of Data-Accumulating Algorithms |
ATAL
2008
Springer
15 years 5 days ago
2008
Springer
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
98
Voted
COCO
2008
Springer
14 years 12 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
COCO
2008
Springer
14 years 12 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
84
Voted
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptu...
EDCC
2008
Springer
14 years 12 months ago
2008
Springer
Faults attacks are a powerful tool to break some implementations of robust cryptographic algorithms such as AES [8] and DES [3]. Various methods of faults attack on cryptographic ...