2430 search results - page 379 / 486 » Computing Tutte Polynomials |
170
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
179
click to vote
ADCM
2011
15 years 1 months ago
2011
Abstract: The Wendland radial basis functions [8, 9] are piecewise polynomial compactly supported reproducing kernels in Hilbert spaces which are norm–equivalent to Sobolev space...
123
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
174
click to vote
COLING
2010
15 years 1 months ago
2010
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...
184
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...