Sciweavers

380 search results - page 65 / 76
» Projective Least-Squares: Global Solutions with Local Optimi...
Sort
View
TSP
2010
14 years 4 months ago
Distributed sparse linear regression
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
Gonzalo Mateos, Juan Andrés Bazerque, Georg...
KDD
2009
ACM
209views Data Mining» more  KDD 2009»
15 years 10 months ago
Collective annotation of Wikipedia entities in web text
To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world...
Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, ...
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
15 years 4 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
FOCS
2008
IEEE
15 years 4 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 4 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke