Sciweavers

2181 search results - page 103 / 437
» The restriction scaffold problem
Sort
View
ICCS
2004
Springer
14 years 3 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
LOPSTR
2004
Springer
14 years 3 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
COCOA
2008
Springer
13 years 11 months ago
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...
Rhonda Chaytor, Patricia A. Evans, Todd Wareham
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
13 years 11 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
JAR
2006
106views more  JAR 2006»
13 years 10 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis