Sciweavers

109 search results - page 8 / 22
» On the Weakenesses of Correlation
Sort
View
COLT
1999
Springer
13 years 11 months ago
Multiclass Learning, Boosting, and Error-Correcting Codes
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
Venkatesan Guruswami, Amit Sahai
CVPR
2008
IEEE
14 years 9 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 7 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
ICIP
2002
IEEE
14 years 9 months ago
Dirty-paper trellis codes for watermarking
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
Gwenaël J. Doërr, Ingemar J. Cox, Matthe...
CCS
2008
ACM
13 years 9 months ago
Is complexity really the enemy of software security?
Software complexity is often hypothesized to be the enemy of software security. We performed statistical analysis on nine code complexity metrics from the JavaScript Engine in the...
Yonghee Shin, Laurie Williams