6045 search results - page 1140 / 1209 » Computable Linearizations of Well-partial-orderings |
IJCAI
2007
13 years 9 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
INTERACT
2007
13 years 9 months ago
2007
User interruptability has become an important topic of study in Human-Computer Interaction (HCI). However, automatically determining the availability of users is still problematic....
IPCO
2007
13 years 9 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
NIPS
2008
13 years 9 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
NIPS
2008
13 years 9 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...