2842 search results - page 128 / 569 » Expansion and Search in Networks |
191
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
163
click to vote
NSF
2001
Springer
15 years 11 months ago
2001
Springer
With the proliferation of 2G and 3G Telecom and other wireless networks hundred of millions of users will be able to access wireless services with their terminals in only a few yea...
155
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
160
click to vote
ERCIMDL
1999
Springer
15 years 10 months ago
1999
Springer
I show that the World Wide Web is a small world, in the sense that sites are highly clustered yet the path length between them is small. I also demonstrate the advantages of a sear...
249
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We address an unsupervised object detection and segmentation problem that goes beyond the conventional assumptions of one-to-one object correspondences or model-test settings betwe...