Sciweavers

1403 search results - page 171 / 281
» Sampling Techniques for Kernel Methods
Sort
View
CCE
2006
14 years 10 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
SI3D
2012
ACM
13 years 5 months ago
Decoupled deferred shading for hardware rasterization
In this paper we present decoupled deferred shading: a rendering technique based on a new data structure called compact geometry buffer, which stores shading samples independently...
Gabor Liktor, Carsten Dachsbacher
RECOMB
2007
Springer
15 years 10 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis

Book
778views
16 years 8 months ago
Gaussian Processes for Machine Learning
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...
Carl Edward Rasmussen and Christopher K. I. Willia...
ECCV
2002
Springer
15 years 12 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal