Sciweavers

2925 search results - page 392 / 585
» Information Complexity of Online Problems
Sort
View
DCC
2008
IEEE
16 years 4 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
WWW
2010
ACM
15 years 11 months ago
Selecting skyline services for QoS-based web service composition
Web service composition enables seamless and dynamic integration of business applications on the web. The performance of the composed application is determined by the performance ...
Mohammad Alrifai, Dimitrios Skoutas, Thomas Risse
INFOCOM
2007
IEEE
15 years 10 months ago
Network Coding in a Multicast Switch
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
Jay Kumar Sundararajan, Muriel Médard, MinJ...
W4A
2005
ACM
15 years 10 months ago
What's the web like if you can't see it?
Awareness of Web accessibility is spreading all over the world among Web designers and developers, due to regulations such as the US law called Section 508 and guidelines like the...
Chieko Asakawa
FC
2006
Springer
129views Cryptology» more  FC 2006»
15 years 8 months ago
Phoolproof Phishing Prevention
Abstract. Phishing, or web spoofing, is a growing problem: the Anti-Phishing Working Group (APWG) received almost 14,000 unique phishing reports in August 2005, a 56% jump over the...
Bryan Parno, Cynthia Kuo, Adrian Perrig