Sciweavers

793 search results - page 83 / 159
» Efficient computation of the characteristic polynomial
Sort
View
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 10 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 3 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
SAT
2007
Springer
184views Hardware» more  SAT 2007»
14 years 3 months ago
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
Gilles Audemard, Lakhdar Sais
CSL
2005
Springer
14 years 2 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
AAAI
2010
13 years 10 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...