3341 search results - page 499 / 669 » On Bounded Queries and Approximation |
263
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
295
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...
193
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
155
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
A weak pseudorandom function (wPRF) is a cryptographic primitive similar to ? but weaker than ? a pseudorandom function: for wPRFs one only requires that the output is pseudorandom...
171
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...