Sciweavers

2516 search results - page 28 / 504
» When is there a representer theorem
Sort
View
149
Voted
TIT
2010
81views Education» more  TIT 2010»
15 years 26 days ago
Generalizing capacity: new definitions and capacity theorems for composite channels
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...
Michelle Effros, Andrea J. Goldsmith, Yifan Liang
ECRTS
2007
IEEE
16 years 15 days ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher
ICDCS
2010
IEEE
15 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
138
Voted
APAL
2006
62views more  APAL 2006»
15 years 6 months ago
Fundamental notions of analysis in subsystems of second-order arithmetic
We develop fundamental aspects of the theory of metric, Hilbert, and Banach spaces in the context of subsystems of second-order arithmetic. In particular, we explore issues having...
Jeremy Avigad, Ksenija Simic
ICIP
2008
IEEE
16 years 8 months ago
The path assigned mean shift algorithm: A new fast mean shift implementation for colour image segmentation
This paper presents a novel method for colour image segmentation derived from the mean shift theorem. When applied to colour image segmentation tasks, the path assigned mean
Akash Pooransingh, Cathy-Ann Radix, Anil C. Kokara...