5316 search results - page 226 / 1064 » Which Search Problems Are Random |
131
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
149
click to vote
VIS
2005
IEEE
16 years 5 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
130
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
144
click to vote
ICMCS
2009
IEEE
15 years 2 months ago
2009
IEEE
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...
149
click to vote
IEEEPACT
1998
IEEE
15 years 8 months ago
1998
IEEE
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...