3875 search results - page 705 / 775 » Approximation Algorithms for the Max-coloring Problem |
AAAI
2011
12 years 7 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
ICDE
1998
IEEE
14 years 9 months ago
1998
IEEE
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...