Sciweavers

2588 search results - page 13 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 4 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
MP
2006
101views more  MP 2006»
14 years 11 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
DAGSTUHL
2010
15 years 19 days ago
Exploring Visualization Methods for Complex Variables
Applications of complex variables and related manifolds appear throughout mathematics and science. Here we review a family of basic methods for applying visualization concepts to ...
Andrew J. Hanson, Ji-Ping Sha
RECOMB
2004
Springer
15 years 11 months ago
Interface surfaces for protein-protein complexes
Protein-protein interactions, which form the basis for most cellular processes, result in the formation of protein interfaces. Believing that the local shape of proteins is crucia...
Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes ...
CVPR
2008
IEEE
16 years 1 months ago
Parameterized Kernel Principal Component Analysis: Theory and applications to supervised and unsupervised image alignment
Parameterized Appearance Models (PAMs) (e.g. eigentracking, active appearance models, morphable models) use Principal Component Analysis (PCA) to model the shape and appearance of...
Fernando De la Torre, Minh Hoai Nguyen