Sciweavers

749 search results - page 106 / 150
» Combinatory Models and Symbolic Computation
Sort
View
CVPR
2008
IEEE
15 years 3 days ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
SMA
2009
ACM
228views Solid Modeling» more  SMA 2009»
14 years 4 months ago
Robust mesh reconstruction from unoriented noisy points
We present a robust method to generate mesh surfaces from unoriented noisy points in this paper. The whole procedure consists of three steps. Firstly, the normal vectors at points...
Hoi Sheung, Charlie C. L. Wang
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 1 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
EDCC
2008
Springer
13 years 12 months ago
Practical Setup Time Violation Attacks on AES
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 ...
Nidhal Selmane, Sylvain Guilley, Jean-Luc Danger
CORR
2011
Springer
221views Education» more  CORR 2011»
13 years 5 months ago
Course on System Design (structural approach)
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
Mark Sh. Levin