1531 search results - page 107 / 307 » Learning probabilistic models of the Web |
170
click to vote
MLDM
2005
Springer
15 years 12 months ago
2005
Springer
We propose an unsupervised, probabilistic method for learning visual feature hierarchies. Starting from local, low-level features computed at interest point locations, the method c...
161
click to vote
NGITS
1995
Springer
15 years 10 months ago
1995
Springer
This paper investigates the problem ofautomatically learning declarative models of information sources available on the Internet. We report on ILA, a domain-independent program th...
297
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
195
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
189
click to vote
ECTEL
2006
Springer
15 years 10 months ago
2006
Springer
In this work informal learning theories and practices and social networking features are taken as starting points to build a reference collaboration model to support collaborative ...