Sciweavers

1845 search results - page 155 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
SIGIR
2012
ACM
13 years 4 months ago
Robust ranking models via risk-sensitive optimization
Many techniques for improving search result quality have been proposed. Typically, these techniques increase average effectiveness by devising advanced ranking features and/or by...
Lidan Wang, Paul N. Bennett, Kevyn Collins-Thompso...
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 3 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
ATAL
2009
Springer
15 years 8 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
128
Voted
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
16 years 6 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
EUROCRYPT
2012
Springer
13 years 4 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...