234 search results - page 27 / 47 » Rademacher Margin Complexity |
VLDB
2002
ACM
13 years 9 months ago
2002
ACM
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
JMLR
2010
13 years 4 months ago
2010
We introduce a nonparametric representation for graphical model on trees which expresses marginals as Hilbert space embeddings and conditionals as embedding operators. This formul...
INFOCOM
2000
IEEE
14 years 2 months ago
2000
IEEE
– We examine in this paper the tradeoff between application complexity, network complexity, and network efficiency. We argue that the design of the current Internet reflects a ...
ICIP
2007
IEEE
14 years 11 months ago
2007
IEEE
This paper deals with conversion from H.264/AVC (Advanced Video Coding) coded video into the MPEG-2 format. The proposed approach exploits similarities between the coding techniqu...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...