Sciweavers

2938 search results - page 227 / 588
» On obfuscating point functions
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
15 years 6 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 5 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
CVPR
2009
IEEE
17 years 1 months ago
Global Optimization for Alignment of Generalized Shapes
In this paper, we introduce a novel algorithm to solve global shape registration problems. We use gray-scale “images” to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...
ICIP
2006
IEEE
16 years 8 months ago
A Partition Constrained Minimization Scheme for Efficient Multiphase Level Set Image Segmentation
This study investigates a new multiphase minimization scheme which embeds a simple, efficient partition constraint directly in multiple level set evolution. Starting from an arbit...
Ismail Ben Ayed, Amar Mitiche
ICIP
2006
IEEE
16 years 8 months ago
Rendering Synthetic Objects in Natural Scenes
We present a method for solving the light integral problem for synthetic diffuse objects rendered within a natural scene. The approach generates realistic shading using only a few...
Mais Alnasser, Hassan Foroosh