Sciweavers

190 search results - page 26 / 38
» www 2001
Sort
View
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
14 years 11 months ago
The diameter of random massive graphs
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu
WWW
2001
ACM
15 years 10 months ago
When experts agree: using non-affiliated experts to rank popular topics
In response to a query a search engine returns a ranked list of documents. If the query is on a popular topic (i.e., it matches many documents) then the returned list is usually t...
Krishna Bharat, George A. Mihaila
OHS
2001
Springer
15 years 2 months ago
FOHM+RTSP: Applying Open Hypermedia and Temporal Linking to Audio Streams
Abstract. The World Wide Web (WWW) was originally designed to handle relatively simple files, containing just text and graphics. With the development of more advanced Web browsers...
Neil Ridgway, David De Roure
WEBNET
2000
14 years 11 months ago
To Measure or not to measure: Why web usability is different from traditional usability
: Web usability is a common term used in discussions of WWW (World Wide Web). This is definitely important, as more and more web sites are frequently visited and have great impact ...
Charlotte Olsson
WWW
2001
ACM
15 years 10 months ago
Enabling full service surrogates using the portable channel representation
The simplicity of the basic client/server model of Web services led quickly to its widespread adoption, but also to scalability and performance problems. The technological respons...
Micah Beck, Terry Moore, Leif Abrahamsson, Christo...