4843 search results - page 295 / 969 » The Shortcut Problem - Complexity and Approximation |
130
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
138
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
119
Voted
WSC
2004
15 years 5 months ago
2004
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
161
Voted
AUTOMATICA
2008
15 years 4 months ago
2008
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
153
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...