837 search results - page 69 / 168 » Hard combinators |
IMA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
102
click to vote
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
WAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The Internet is facing ever-increasing complexity in the construction, configuration and management of heterogeneous networks. New communication paradigms are underminin...
PODC
2004
ACM
15 years 5 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
CLEF
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The ImageCLEF task of CLEF has a main goal in the retrieval of images from multi–lingual collections. The 2003 imageCLEF saw no group using the visual information of im...