Sciweavers

4378 search results - page 611 / 876
» On the Complexity of Ordered Colourings
Sort
View
DAC
2007
ACM
15 years 10 months ago
Side-Channel Attack Pitfalls
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
Kris Tiri
ECCV
2010
Springer
15 years 10 months ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
EATIS
2007
ACM
15 years 10 months ago
Ontology Based Affective Context Representation
In this paper we propose an ontology based representation of the affective states for context aware applications that allows expressing the complex relations that are among the af...
Kuderna-Iulian Benta, Anca Rarau, Marcel Cremene
CONCUR
2009
Springer
15 years 10 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
DAC
2010
ACM
15 years 10 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler