Sciweavers

67 search results - page 9 / 14
» A New Exact Algorithm for the Two-Sided Crossing Minimizatio...
Sort
View
JMLR
2012
11 years 11 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
DAM
2000
137views more  DAM 2000»
13 years 8 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
ICML
2008
IEEE
14 years 9 months ago
Listwise approach to learning to rank: theory and algorithm
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, Ha...
EDBTW
2010
Springer
14 years 1 months ago
The view update problem for XML
We study the problem of update propagation across views in the setting where both the view and the source database are XML documents. We consider a simple class of XML views that ...
Slawek Staworko, Iovka Boneva, Benoît Groz
ALGORITHMICA
2011
13 years 3 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal