1573 search results - page 259 / 315 » A Data Structure for Sponsored Search |
DEBU
1998
14 years 11 months ago
1998
The amount of information available online has grown enormously over the past decade. Fortunately, computing power, disk capacity, and network bandwidth have also increased dramat...
126
click to vote
SOICT
2010
14 years 6 months ago
2010
Protecting data by passwords in documents such as DOC, PDF or RAR, ZIP archives has been demonstrated to be weak under dictionary attacks. Time for recovering the passwords of suc...
119
click to vote
ASPLOS
2011
ACM
14 years 3 months ago
2011
ACM
Concurrency bugs are caused by non-deterministic interleavings between shared memory accesses. Their effects propagate through data and control dependences until they cause softwa...
109
click to vote
ACL
2009
14 years 9 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
196
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...