Sciweavers

6045 search results - page 945 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ICISC
2007
97views Cryptology» more  ICISC 2007»
15 years 8 months ago
New Local Collisions for the SHA-2 Hash Family
The starting point for collision attacks on practical hash functions is a local collision. In this paper, we make a systematic study of local collisions for the SHA-2 family. The p...
Somitra Kumar Sanadhya, Palash Sarkar
NIPS
2008
15 years 8 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
NIPS
2008
15 years 8 months ago
Multi-label Multiple Kernel Learning
We present a multi-label multiple kernel learning (MKL) formulation in which the data are embedded into a low-dimensional space directed by the instancelabel correlations encoded ...
Shuiwang Ji, Liang Sun, Rong Jin, Jieping Ye
AAAI
2006
15 years 8 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
NIPS
2001
15 years 8 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...