Sciweavers

2504 search results - page 403 / 501
» Methods for comparing rankings of search engine results
Sort
View
CVPR
2007
IEEE
16 years 3 months ago
Linear and Quadratic Subsets for Template-Based Tracking
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
Selim Benhimane, Alexander Ladikos, Vincent Lepeti...
WWW
2006
ACM
16 years 2 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
SAC
2006
ACM
15 years 7 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
CGF
2011
14 years 5 months ago
A Sparse Parametric Mixture Model for BTF Compression, Editing and Rendering
Bidirectional texture functions (BTFs) represent the appearance of complex materials. Three major shortcomings with BTFs are the bulky storage, the difficulty in editing and the ...
Hongzhi Wu, Julie Dorsey, Holly E. Rushmeier
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
15 years 2 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...