Sciweavers

1522 search results - page 114 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Grading nuclear pleomorphism on histological micrographs
A mainstay in cancer diagnostics is the classification or grading of cell nuclei based on their appearance. While the analysis of cytological samples has been automated successful...
Eric Cosatto, Matthew Miller, Hans Peter Graf, Joh...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 3 months ago
Acquiring evolvability through adaptive representations
Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be ...
Joseph Reisinger, Risto Miikkulainen
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 2 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
FOCS
1993
IEEE
14 years 1 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
NIPS
2008
13 years 10 months ago
Policy Search for Motor Primitives in Robotics
Many motor skills in humanoid robotics can be learned using parametrized motor primitives as done in imitation learning. However, most interesting motor learning problems are high...
Jens Kober, Jan Peters