1641 search results - page 186 / 329 » Termination Analysis with Algorithmic Learning |
116
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
97
Voted
SYNASC
2007
IEEE
15 years 6 months ago
2007
IEEE
In recent years several models have been proposed for text categorization. Within this, one of the widely applied models is the vector space model (VSM), where independence betwee...
114
Voted
STOC
2006
ACM
16 years 26 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
150
click to vote
ALT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
114
click to vote
JMLR
2006
15 years 15 days ago
2006
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...