3415 search results - page 294 / 683 » Lower bounds on kernelization |
224
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
177
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
210
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
180
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
162
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
—In this paper, we derive tight upper and lower bounds for the average sum rate of two-way amplify-andforward (AF) half-duplex relaying, which show that two-way AF half-duplex re...