Sciweavers

159 search results - page 27 / 32
» Weak Equivalences in Psi-Calculi
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
ACTA
2010
87views more  ACTA 2010»
15 years 6 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro
APAL
2007
79views more  APAL 2007»
15 years 6 months ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour
IJSNET
2006
131views more  IJSNET 2006»
15 years 6 months ago
Medium access control with mobility-adaptive mechanisms for wireless sensor networks
: Mobility in wireless sensor networks poses unique challenges to the medium access control (MAC) protocol design. Previous MAC protocols for sensor networks assume static sensor n...
Muneeb Ali, Zartash Afzal Uzmi
MOR
2008
94views more  MOR 2008»
15 years 6 months ago
Metastable Equilibria
We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local best-rep...
Srihari Govindan, Robert Wilson