1653 search results - page 145 / 331 » Directed tree-width examples |
156
click to vote
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
116
Voted
COLT
1999
Springer
15 years 6 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
ACL
1997
15 years 3 months ago
1997
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...
130
click to vote
HPCA
2006
IEEE
16 years 2 months ago
2006
IEEE
Computer systems increasingly rely on dynamic, phasebased system management techniques, in which system hardware and software parameters may be altered or tuned at runtime for dif...
114
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...