1629 search results - page 132 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
176
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
156
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...
161
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
181
click to vote
JMLR
2006
15 years 6 months ago
2006
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
218
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...