9842 search results - page 287 / 1969 » The Complexity of the Matching-Cut Problem |
219
Voted
ICAART
2010
INSTICC
16 years 21 days ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
144
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
104
click to vote
ANTS
2004
Springer
15 years 9 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
222
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
110
Voted
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...