Sciweavers

6368 search results - page 1024 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Conditional density learning via regression with application to deformable shape segmentation
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
Jingdan Zhang, Shaohua Kevin Zhou, Dorin Comaniciu...
ICRA
2007
IEEE
189views Robotics» more  ICRA 2007»
16 years 29 days ago
Context Estimation and Learning Control through Latent Variable Extraction: From discrete to continuous contexts
— Recent advances in machine learning and adaptive motor control have enabled efficient techniques for online learning of stationary plant dynamics and it’s use for robust pre...
Georgios Petkos, Sethu Vijayakumar
RSA
2008
80views more  RSA 2008»
15 years 5 months ago
The persistent-access-caching algorithm
ABSTRACT: Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching syste...
Predrag R. Jelenkovic, Ana Radovanovic
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
ICALP
2010
Springer
15 years 11 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie
« Prev « First page 1024 / 1274 Last » Next »