Sciweavers

1541 search results - page 151 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CLEF
2010
Springer
13 years 9 months ago
Using Web Graph Structure for Person Name Disambiguation
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
Elena Smirnova, Konstantin Avrachenkov, Brigitte T...
CVPR
2012
IEEE
11 years 10 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
IPPS
2005
IEEE
14 years 1 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
CVPR
2006
IEEE
14 years 10 months ago
Quantitative Evaluation of Near Regular Texture Synthesis Algorithms
Near regular textures are pervasive in man-made and natural world. Their global regularity and local randomness pose new difficulties to the state of the art texture analysis and ...
Wen-Chieh Lin, James Hays, Chenyu Wu, Yanxi Liu, V...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 8 months ago
SPOT: An R Package For Automatic and Interactive Tuning of Optimization Algorithms by Sequential Parameter Optimization
The sequential parameter optimization (spot) package for R (R Development Core Team, 2008) is a toolbox for tuning and understanding simulation and optimization algorithms. Model-...
Thomas Bartz-Beielstein