Sciweavers

368 search results - page 22 / 74
» System BV is NP-complete
Sort
View
IJON
2006
109views more  IJON 2006»
14 years 9 months ago
Associative memory of connectivity patterns
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
Junmei Zhu, Christoph von der Malsburg
IJON
2006
74views more  IJON 2006»
14 years 9 months ago
Real-time simulations of networks of Hodgkin-Huxley neurons using analog circuits
The traditional dilemma for performing network simulations with analog circuits is the great difficulty of handling the connectivity in hardware. The main problem is that hardware...
Quan Zou, Yannick Bornat, Jean Tomas, Sylvie Renau...
CSI
2007
54views more  CSI 2007»
14 years 9 months ago
A practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed...
Jian-jie Zhao, Jianzhong Zhang 0005, Rong Zhao
DSS
2007
104views more  DSS 2007»
14 years 9 months ago
Investigating interactions of trust and interest similarity
Online communities that allow their users to express their personal preferences, such as the members they trust and the products they appreciate, are becoming increasingly popular...
Cai-Nicolas Ziegler, Jennifer Golbeck
77
Voted
AI
2005
Springer
14 years 9 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf