Sciweavers

1968 search results - page 197 / 394
» The Complexity of Valued Constraint Models
Sort
View
121
Voted
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 6 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
ESORICS
2009
Springer
16 years 2 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
HICSS
2008
IEEE
128views Biometrics» more  HICSS 2008»
15 years 8 months ago
Service Composition Language to Unify Simulation and Optimization of Supply Chains
Proposed and developed is the language Service Composition (SC) CoJava, which extends the programming language Java with (1) a modular service composition framework; (2) an extens...
Alexander Brodsky, Malak Al-Nory, Hadon Nash
IGIS
1994
118views GIS» more  IGIS 1994»
15 years 5 months ago
Surface Modelling with Guaranteed Consistency - An Object-Based Approach
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
Christopher M. Gold, Thomas Roos
SIMVIS
2004
15 years 3 months ago
3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
Angela Brennecke, Tobias Isenberg