522 search results - page 13 / 105 » On the Hardness of the Noncommutative Determinant |
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
ERLANG
2003
ACM
14 years 1 months ago
2003
ACM
This paper presents a soft-typing system for the programming language Erlang. The system is based on two concepts; a (forward) data flow analysis that determines upper approximat...
ESANN
2008
13 years 9 months ago
2008
In this work, we developed classifiers to distinguish between four ovarian tumor types using Bayesian least squares support vector machines (LS-SVMs) and kernel logistic regression...
CAEPIA
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buyers when trying to determine the best set of prov...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...