Sciweavers

664 search results - page 94 / 133
» An objective way to evaluate and compare binarization algori...
Sort
View
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 1 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
STACS
2009
Springer
14 years 2 months ago
A Comparison of Techniques for Sampling Web Pages
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
Eda Baykan, Monika Rauch Henzinger, Stefan F. Kell...
ICLP
2010
Springer
13 years 11 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
JAIR
2011
123views more  JAIR 2011»
13 years 2 months ago
Regression Conformal Prediction with Nearest Neighbours
In this paper we apply Conformal Prediction (CP) to the k-Nearest Neighbours Regression (k-NNR) algorithm and propose ways of extending the typical nonconformity measure used for ...
Harris Papadopoulos, Vladimir Vovk, Alexander Gamm...
CIVR
2009
Springer
253views Image Analysis» more  CIVR 2009»
14 years 2 months ago
Spatial extensions to bag of visual words
The Bag of Visual Words (BoV) paradigm has successfully been applied to image content analysis tasks such as image classification and object detection. The basic BoV approach ove...
Ville Viitaniemi, Jorma Laaksonen