Sciweavers

5387 search results - page 501 / 1078
» Generating generic functions
Sort
View
FOCS
2010
IEEE
15 years 5 months ago
The Complexity of Distributions
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
Emanuele Viola
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
16 years 11 days ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
BMCBI
2007
134views more  BMCBI 2007»
15 years 7 months ago
Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...
Curtis Huttenhower, Avi I. Flamholz, Jessica N. La...
ICIP
2000
IEEE
16 years 8 months ago
Curve Evolution, Boundary-Value Stochastic Processes, the Mumford-Shah Problem, and Missing Data Applications
We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
EUROGRAPHICS
2010
Eurographics
16 years 4 months ago
Isosurfaces Over Simplicial Partitions of Multiresolution Grids
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
Josiah Manson and Scott Schaefer