1391 search results - page 220 / 279 » Complexity Limitations on Quantum Computation |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
This paper addresses the segmentation from an image of entities that have the form of a `network', i.e. the region in the image corresponding to the entity is composed of bran...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Anycast-based content delivery networks (CDNs) have many properties that make them ideal for the large scale distribution of content on the Internet. However, because routing chan...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresent...