Sciweavers

33 search results - page 4 / 7
» Set-theoretic solutions of the Yang-Baxter equation, graphs ...
Sort
View
CEC
2011
IEEE
13 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...

Publication
1500views
16 years 10 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected aut...
M. Sabry Hassouna, Aly A. Farag

Presentation
3660views
16 years 10 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
M. Sabry Hassouna
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
14 years 9 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald