1920 search results - page 262 / 384 » The Complexity of the A B C Problem |
155
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
145
click to vote
JACM
2000
15 years 5 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
187
click to vote
PAMI
2007
15 years 5 months ago
2007
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
180
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
172
Voted
ACSD
2010
IEEE
15 years 3 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...