Sciweavers

2957 search results - page 473 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
ICML
2008
IEEE
14 years 9 months ago
An HDP-HMM for systems with state persistence
The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstra...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
ICML
2006
IEEE
14 years 9 months ago
Regression with the optimised combination technique
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
Jochen Garcke
ICML
2004
IEEE
14 years 9 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
WWW
2005
ACM
14 years 9 months ago
The volume and evolution of web page templates
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
David Gibson, Kunal Punera, Andrew Tomkins