13603 search results - page 228 / 2721 » On the Computational Complexity of Cut-Reduction |
169
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
175
click to vote
CASC
2010
Springer
15 years 5 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
174
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
191
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
194
click to vote
AGI
2011
14 years 10 months ago
2011
Abstract. Recurrent connectivity, balanced between excitation and inhibition, is a general principle of cortical connectivity. We propose that balanced recurrence can be achieved b...