796 search results - page 68 / 160 » Approximating the centroid is hard |
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
EUROCRYPT
2010
Springer
14 years 15 days ago
2010
Springer
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
INFOCOM
2000
IEEE
14 years 2 days ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...