Sciweavers

4998 search results - page 753 / 1000
» The case for intentional networking
Sort
View
ML
2007
ACM
13 years 8 months ago
Feature space perspectives for learning the kernel
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
Charles A. Micchelli, Massimiliano Pontil
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
13 years 7 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
ISOLA
2010
Springer
13 years 7 months ago
Towards More Adaptive Voice Applications
With the Internet designed to provide best-effort packet transmission, applications are expected to adapt dynamically to the operating conditions observed in the network. For this ...
Jörg Ott
JSAC
2010
87views more  JSAC 2010»
13 years 7 months ago
On the Scalability of BGP: The Role of Topology Growth
—The scalability of BGP routing is a major concern for the Internet community. Scalability is an issue in two different aspects: increasing routing table size, and increasing rat...
Ahmed Elmokashfi, Amund Kvalbein, Constantinos Dov...
MST
2010
106views more  MST 2010»
13 years 7 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg