15033 search results - page 2939 / 3007 » Complexity Theory and Algorithms |
SIGIR
2004
ACM
15 years 3 months ago
2004
ACM
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
SIGMETRICS
2004
ACM
15 years 3 months ago
2004
ACM
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
103
click to vote
GI
2004
Springer
15 years 3 months ago
2004
Springer
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...