4324 search results - page 39 / 865 » A Generalized Representer Theorem |
90
Voted
DM
2007
15 years 20 days ago
2007
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...
96
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
113
click to vote
ACL
1996
15 years 2 months ago
1996
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...
86
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
126
Voted
PLDI
2003
ACM
15 years 6 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...