Sciweavers

1578 search results - page 193 / 316
» Algorithmic randomness of continuous functions
Sort
View
IACR
2011
94views more  IACR 2011»
12 years 8 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
TEC
2002
183views more  TEC 2002»
13 years 8 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
CVPR
2003
IEEE
14 years 11 months ago
Bayesian Tangent Shape Model: Estimating Shape and Pose Parameters via Bayesian Inference
12 In this paper we study the problem of shape analysis and its application in locating facial feature points on frontal faces. We propose a Bayesian inference solution based on ta...
Yi Zhou, Lie Gu, HongJiang Zhang
ICML
2005
IEEE
14 years 9 months ago
Active learning for sampling in time-series experiments with application to gene expression analysis
Many time-series experiments seek to estimate some signal as a continuous function of time. In this paper, we address the sampling problem for such experiments: determining which ...
Rohit Singh, Nathan Palmer, David K. Gifford, Bonn...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 3 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn