Sciweavers

120 search results - page 18 / 24
» Measures for Benchmarking of Automatic Correspondence Algori...
Sort
View
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
14 years 2 months ago
Swarming to rank for information retrieval
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...
Ernesto Diaz-Aviles, Wolfgang Nejdl, Lars Schmidt-...
ATAL
2005
Springer
14 years 1 months ago
Formalising trust for online communities
Provision of services within a virtual framework for resource sharing across institutional boundaries has become an active research area. Many such services encode access to compu...
Ali Shaikh Ali, Omer F. Rana
ICS
1993
Tsinghua U.
13 years 11 months ago
Static and Dynamic Evaluation of Data Dependence Analysis
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...
Paul Petersen, David A. Padua
CORR
2000
Springer
126views Education» more  CORR 2000»
13 years 7 months ago
Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach
We investigate the performance of two machine learning algorithms in the context of antispam filtering. The increasing volume of unsolicited bulk e-mail (spam) has generated a nee...
Ion Androutsopoulos, Georgios Paliouras, Vangelis ...
CVPR
2008
IEEE
14 years 9 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...