1920 search results - page 43 / 384 » The Complexity of the A B C Problem |
147
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper we study the following problem: given two source images A and A , and a target image B, can we learn to synthesize a new image B which relates to B in the same way t...
197
click to vote
SIAMDM
2008
15 years 5 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
156
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
183
click to vote
TOCL
2008
15 years 5 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
140
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...