Sciweavers

1951 search results - page 173 / 391
» An algorithm for improving graph partitions
Sort
View
CVPR
2008
IEEE
16 years 7 months ago
From skeletons to bone graphs: Medial abstraction for object recognition
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...
Diego Macrini, Kaleem Siddiqi, Sven J. Dickinson
CIKM
2008
Springer
15 years 7 months ago
Structure feature selection for graph classification
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
Hongliang Fei, Jun Huan
SACRYPT
2007
Springer
126views Cryptology» more  SACRYPT 2007»
15 years 11 months ago
Improved Side-Channel Collision Attacks on AES
Abstract. Side-channel collision attacks were proposed in [1] and applied to AES in [2]. These are based on detecting collisions in certain positions of the internal state after th...
Andrey Bogdanov
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
15 years 11 months ago
Pre-synthesis optimization of multiplications to improve circuit performance
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially i...
Rafael Ruiz-Sautua, María C. Molina, Jos&ea...
QEST
2006
IEEE
15 years 11 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...