3894 search results - page 471 / 779 » Approximation Algorithms for Biclustering Problems |
133
click to vote
AAAI
1994
15 years 5 months ago
1994
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
149
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
150
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We consider the problem of multiple mobile sensor agents tracking the position of one or more moving targets. In our formulation, each agent maintains a target estimate, and ea...
120
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We present an extension of the Dynamics Based Control (DBC) paradigm to environment models based on Predictive State Representations (PSRs). We show an approximate greedy version ...
158
click to vote
TCS
2011
14 years 11 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...