7129 search results - page 932 / 1426 » Approximation Algorithms for Treewidth |
122
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
131
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A variety of kernel learning algorithms have been prop...
141
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Recently, a very appealing approach was proposed to compute the entire solution path for support vector classification (SVC) with very low extra computational cost. This approach ...
150
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the ...
142
click to vote
RECOMB
2005
Springer
16 years 5 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...