Sciweavers

2938 search results - page 120 / 588
» On obfuscating point functions
Sort
View
CATS
2006
15 years 7 months ago
Boolean equation solving as graph traversal
We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...
Brian Herlihy, Peter Schachte, Harald Sønde...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 16 days ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
ACCV
2006
Springer
16 years 11 days ago
Super Resolution Using Graph-Cut
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...
Uma Mudenagudi, Ram Singla, Prem Kumar Kalra, Subh...
GM
1999
Springer
15 years 10 months ago
Data-Dependent Triangulation in the Plane with Adaptive Knot Placement
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
René Schätzl, Hans Hagen, James C. Bar...
GD
2006
Springer
15 years 10 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...