1941 search results - page 118 / 389 » On the Hardness of Approximate Reasoning |
195
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
184
click to vote
GIS
2010
ACM
15 years 5 months ago
2010
ACM
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the d...
173
click to vote
ICGI
2010
Springer
15 years 4 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 ...
166
click to vote
GLOBECOM
2007
IEEE
16 years 22 days 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...
174
click to vote
WADS
2005
Springer
15 years 12 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...