Sciweavers

2914 search results - page 167 / 583
» Learning and Inference with Constraints
Sort
View
TIST
2011
136views more  TIST 2011»
15 years 1 months ago
Probabilistic models for concurrent chatting activity recognition
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
Jane Yung-jen Hsu, Chia-chun Lian, Wan-rong Jih
ECTEL
2007
Springer
16 years 20 days ago
Exploiting Preference Queries for Searching Learning Resources
While the growing number of learning resources increases the choice for learners, it also makes it more and more difficult to find suitable courses. Thus, improved search capabili...
Fabian Abel, Eelco Herder, Philipp Kärger, Da...
AI
2005
Springer
16 years 1 days ago
A Supervised Learning Approach to Acronym Identification
This paper addresses the task of finding acronym-definition pairs in text. Most of the previous work on the topic is about systems that involve manually generated rules or regular ...
David Nadeau, Peter D. Turney
CVPR
2000
IEEE
16 years 8 months ago
Order Parameters for Minimax Entropy Distributions: When Does High Level Knowledge Help?
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
Alan L. Yuille, James M. Coughlan, Song Chun Zhu, ...
ICML
2006
IEEE
16 years 7 months ago
A choice model with infinitely many latent features
Elimination by aspects (EBA) is a probabilistic choice model describing how humans decide between several options. The options from which the choice is made are characterized by b...
Carl Edward Rasmussen, Dilan Görür, Fran...