Sciweavers

3147 search results - page 171 / 630
» Statistically Hiding Sets
Sort
View
JSC
2006
106views more  JSC 2006»
14 years 11 months ago
Markov bases for noncommutative Fourier analysis of ranked data
To calibrate Fourier analysis of S5 ranking data by Markov chain Monte Carlo techniques, a set of moves (Markov basis) is needed. We calculate this basis, and use it to provide a ...
Persi Diaconis, Nicholas Eriksson
ICML
2000
IEEE
16 years 17 days ago
Learning to Probabilistically Identify Authoritative Documents
We describe a model of document citation that learns to identify hubs and authorities in a set of linked documents, such as pages retrieved from the world wide web, or papers retr...
David Cohn, Huan Chang
ICML
2009
IEEE
15 years 6 months ago
Rule learning with monotonicity constraints
In classification with monotonicity constraints, it is assumed that the class label should increase with increasing values on the attributes. In this paper we aim at formalizing ...
Wojciech Kotlowski, Roman Slowinski
SAMT
2007
Springer
95views Multimedia» more  SAMT 2007»
15 years 5 months ago
A Study of Vocabularies for Image Annotation
Abstract. In order to evaluate image annotation and object categorisation algorithms, ground truth in the form of a set of images correctly annotated with text describing each imag...
Allan Hanbury
92
Voted
ICAPR
2005
Springer
15 years 5 months ago
Missing Data Estimation Using Polynomial Kernels
Abstract. In this paper, we deal with the problem of partially observed objects. These objects are defined by a set of points and their shape variations are represented by a statis...
Maxime Berar, Michel Desvignes, Gérard Bail...