9209 search results - page 1513 / 1842 » Data Space Randomization |
180
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
148
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
158
Voted
ISCC
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
169
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
142
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
The selection of weak classifiers is critical to the success of boosting techniques. Poor weak classifiers do not perform better than random guess, thus cannot help decrease the t...