Sciweavers

10213 search results - page 1747 / 2043
» An Experimental Analysis of Parallel
Sort
View
MST
2010
98views more  MST 2010»
15 years 5 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
NN
2010
Springer
183views Neural Networks» more  NN 2010»
15 years 5 months ago
Dimensionality reduction for density ratio estimation in high-dimensional spaces
The ratio of two probability density functions is becoming a quantity of interest these days in the machine learning and data mining communities since it can be used for various d...
Masashi Sugiyama, Motoaki Kawanabe, Pui Ling Chui
PR
2010
163views more  PR 2010»
15 years 5 months ago
A comparative evaluation of interactive segmentation algorithms
In this paper we present a comparative evaluation of four popular interactive segmentation algorithms. The evaluation was carried out as a series of user-experiments, in which par...
Kevin McGuinness, Noel E. O'Connor
PRL
2010
181views more  PRL 2010»
15 years 5 months ago
Gait recognition without subject cooperation
The strength of gait, compared to other biometrics, is that it does not require cooperative subjects. Previoius gait recognition approaches were evaluated using a gallery set cons...
Khalid Bashir, Tao Xiang, Shaogang Gong
PVLDB
2010
97views more  PVLDB 2010»
15 years 5 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
« Prev « First page 1747 / 2043 Last » Next »