page 59947 / 60054 » publications |
WWW
2004
ACM
16 years 16 days ago
2004
ACM
?????????!#"$?%?&'???(?)0132&????46572(481?9?1@%??AB0?&? 5C2D4FEG?9H'???E?D?&I?&2A?P%%?Q?9??4R%?&ST?&%!PU?)'?1?9?DV8WX5?A?&S ??...
111
click to vote
WWW
2003
ACM
16 years 16 days ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
130
click to vote
WWW
2003
ACM
16 years 16 days ago
2003
ACM
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
STOC
2009
ACM
16 years 14 days ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
STOC
2009
ACM
16 years 14 days ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...