Sciweavers

1653 search results - page 160 / 331
» Directed tree-width examples
Sort
View
ICML
2005
IEEE
16 years 5 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic
ICML
2004
IEEE
16 years 5 months ago
Nonparametric classification with polynomial MPMC cascades
A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial ...
Sander M. Bohte, Markus Breitenbach, Gregory Z. Gr...
ICML
2004
IEEE
16 years 5 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik
ICML
2003
IEEE
16 years 5 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
WWW
2007
ACM
16 years 5 months ago
ActiveRDF: object-oriented semantic web programming
Object-oriented programming is the current mainstream programming paradigm but existing RDF APIs are mostly tripleoriented. Traditional techniques for bridging a similar gap betwe...
Eyal Oren, Renaud Delbru, Sebastian Gerke, Armin H...