Sciweavers

6906 search results - page 103 / 1382
» An algorithm for modelling key terms
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 6 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 11 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
WWW
2004
ACM
16 years 5 months ago
Index structures and algorithms for querying distributed RDF repositories
A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Sui...
Heiner Stuckenschmidt, Richard Vdovjak, Geert-Jan ...
ATAL
2008
Springer
15 years 6 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
INFORMS
2010
147views more  INFORMS 2010»
15 years 1 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng