327 search results - page 5 / 66 » Some Elimination Problems for Matrices |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
PAKDD
2007
ACM
14 years 3 months ago
2007
ACM
A mobile node in ad hoc networks may move arbitrarily and acts as a router and a host simultaneously. Such a characteristic makes nodes in MANET vulnerable to potential attacks. Th...
TABLEAUX
1995
Springer
14 years 1 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
ACSC
2004
IEEE
14 years 1 months ago
2004
IEEE
We have been investigating ways in which the performance of model elimination based systems can be improved and in this paper we present some of our results. Firstly, we have inve...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we ...