Sciweavers

2252 search results - page 40 / 451
» Improving Random Forests
Sort
View
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
14 years 8 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...
SIGIR
2009
ACM
14 years 2 months ago
An improved markov random field model for supporting verbose queries
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
Matthew Lease
PSIVT
2007
Springer
170views Multimedia» more  PSIVT 2007»
14 years 2 months ago
Markov Random Fields and Spatial Information to Improve Automatic Image Annotation
Content-based image retrieval (CBIR) is currently limited because of the lack of representational power of the low-level image features, which fail to properly represent the actual...
Carlos Hernández-Gracidas, Luis Enrique Suc...
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
14 years 2 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak
EPEW
2006
Springer
13 years 11 months ago
Precise Regression Benchmarking with Random Effects: Improving Mono Benchmark Results
Benchmarking as a method of assessing software performance is known to suffer from random fluctuations that distort the observed performance. In this paper, we focus on the fluctua...
Tomás Kalibera, Petr Tuma