Sciweavers

7811 search results - page 1362 / 1563
» computing 2004
Sort
View
121
Voted
CCR
2007
115views more  CCR 2007»
15 years 3 months ago
Analysis of the SPV secure routing protocol: weaknesses and lessons
We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (...
Barath Raghavan, Saurabh Panjwani, Anton Mityagin
121
Voted
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 3 months ago
Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
Matthieu Gallet, Yves Robert, Frédér...
JCS
2008
109views more  JCS 2008»
15 years 3 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
JMLR
2006
156views more  JMLR 2006»
15 years 3 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
140
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 3 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
« Prev « First page 1362 / 1563 Last » Next »