9997 search results - page 1607 / 2000 » The case for crowd computing |
165
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
160
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
201
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
190
Voted
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
163
click to vote
AIIA
2007
Springer
15 years 8 months ago
2007
Springer
Few works are available in the literature to define similarity criteria between First-Order Logic formulæ, where the presence of relations causes various portions of one descript...