Sciweavers

2252 search results - page 197 / 451
» Improving Random Forests
Sort
View
MIDDLEWARE
2005
Springer
15 years 9 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
100
Voted
COLT
2008
Springer
15 years 5 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
124
Voted
JAL
2008
97views more  JAL 2008»
15 years 3 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
IACR
2011
127views more  IACR 2011»
14 years 3 months ago
Cryptanalysis of KeeLoq code-hopping using a Single FPGA
The KeeLoq cipher is used in many wireless car door systems and garage openers. Recently the algorithm was studied and several attacks have been published. When a random seed is no...
Idan Sheetrit, Avishai Wool
ICCV
2009
IEEE
16 years 8 months ago
Segmentation and Shading Estimation in Slowly Changing Textured Images
We present a novel representation for modeling textured regions subject to smooth variations in orientation and scale. Utilizing the steerable pyramid of Simoncelli and Freeman ...
Jason Chang, John W. Fisher III