Sciweavers

999 search results - page 192 / 200
» Finding shapes in a set of points
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
Improving the performance of object-oriented languages with dynamic predication of indirect jumps
Indirect jump instructions are used to implement increasinglycommon programming constructs such as virtual function calls, switch-case statements, jump tables, and interface calls...
José A. Joao, Onur Mutlu, Hyesoon Kim, Rish...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
CVPR
2009
IEEE
15 years 2 months ago
Optimization of Landmark Selection for Cortical Surface Registration
Manually labeled landmark sets are often required as in- puts for landmark-based image registration. Identifying an optimal subset of landmarks from a training dataset may be us...
Anand A. Joshi, David W. Shattuck, Dimitrios Panta...
ICCV
2001
IEEE
14 years 9 months ago
Noise in Bilinear Problems
: Despite the wide application of bilinear problems to problems both in computer vision and in other fields, their behaviour under the effects of noise is still poorly understood. ...
John A. Haddon, David A. Forsyth
DAGM
2010
Springer
13 years 8 months ago
Gaussian Mixture Modeling with Gaussian Process Latent Variable Models
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
Hannes Nickisch, Carl Edward Rasmussen