Sciweavers

1884 search results - page 156 / 377
» World wide failures
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 7 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
CHI
2001
ACM
16 years 7 months ago
Accordion summarization for end-game browsing on PDAs and cellular phones
We demonstrate a new browsing technique for devices with small displays such as PDAs or cellular phones. We concentrate on end-game browsing, where the user is close to or on the ...
Orkut Buyukkokten, Hector Garcia-Molina, Andreas P...
CHI
2001
ACM
16 years 7 months ago
Empirically validated web page design metrics
A quantitative analysis of a large collection of expert-rated web sites reveals that page-level metrics can accurately predict if a site will be highly rated. The analysis also pr...
Melody Y. Ivory, Rashmi R. Sinha, Marti A. Hearst
SIGMOD
2002
ACM
187views Database» more  SIGMOD 2002»
16 years 6 months ago
A Conceptual Architecture for Semantic Web Enabled Web Services
Semantic Web Enabled Web Services (SWWS) will transform the web from a static collection of information into a distributed device of computation on the basis of Semantic Web techn...
Christoph Bussler, Dieter Fensel, Alexander Maedch...
DCC
2001
IEEE
16 years 6 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher