3910 search results - page 455 / 782 » Analyzing Cross-Connected Networks |
164
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
—With significant improvements in both wireless technologies and computational capabilities of mobile devices, it is now possible to exchange and render 3D graphics over wireless...
196
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
196
click to vote
ICMI
2007
Springer
16 years 26 days ago
2007
Springer
In this paper, we describe an interface consisting of a virtual showroom where a team of two highly realistic 3D agents presents product items in an entertaining and attractive wa...
176
click to vote
GLOBECOM
2006
IEEE
16 years 23 days ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
187
click to vote
MICRO
2006
IEEE
16 years 22 days ago
2006
IEEE
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...