1279 search results - page 209 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
STACS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
ECML
2006
Springer
14 years 15 days ago
2006
Springer
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
PODS
2010
ACM
13 years 9 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
JEA
2006
13 years 8 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...