569 search results - page 40 / 114 » Online Bounds for Bayesian Algorithms |
AAMAS
2007
Springer
14 years 10 months ago
2007
Springer
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
JCDL
2006
ACM
15 years 3 months ago
2006
ACM
Citation matching, or the automatic grouping of bibliographic references that refer to the same document, is a data management problem faced by automatic digital libraries for sci...
PAKDD
2009
ACM
15 years 2 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
ICMLA
2007
14 years 11 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
IPL
2006
14 years 9 months ago
2006
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...