Sciweavers

3600 search results - page 303 / 720
» The settling-time reducibility ordering
Sort
View
IPL
2010
93views more  IPL 2010»
15 years 5 months ago
Compiling and securing cryptographic protocols
Protocol narrations are widely used in security as semi-formal notations to specify conversations between roles. We define a translation from a protocol narration to the sequence...
Yannick Chevalier, Michaël Rusinowitch
ISNN
2010
Springer
15 years 5 months ago
Pruning Training Samples Using a Supervised Clustering Algorithm
As practical pattern classification tasks are often very-large scale and serious imbalance such as patent classification, using traditional pattern classification techniques in ...
Minzhang Huang, Hai Zhao, Bao-Liang Lu
160
Voted
NECO
2010
97views more  NECO 2010»
15 years 5 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
SIGOPS
2010
124views more  SIGOPS 2010»
15 years 5 months ago
Decoupling storage and computation in Hadoop with SuperDataNodes
The rise of ad-hoc data-intensive computing has led to the development of data-parallel programming systems such as Map/Reduce and Hadoop, which achieve scalability by tightly cou...
George Porter
SIGPRO
2010
154views more  SIGPRO 2010»
15 years 5 months ago
UPRE method for total variation parameter selection
Total Variation (TV) regularization is a popular method for solving a wide variety of inverse problems in image processing. In order to optimize the reconstructed image, it is imp...
Youzuo Lin, Brendt Wohlberg, Hongbin Guo