Sciweavers

6393 search results - page 96 / 1279
» Randomized Algorithms on the Mesh
Sort
View
140
Voted
DAM
2006
79views more  DAM 2006»
15 years 3 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
113
Voted
SIGGRAPH
1999
ACM
15 years 7 months ago
Optimization of Mesh Locality for Transparent Vertex Caching
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
Hugues Hoppe
ICC
2009
IEEE
155views Communications» more  ICC 2009»
15 years 10 months ago
Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
Jing Xie, King-Shan Lui
114
Voted
JSAC
2007
78views more  JSAC 2007»
15 years 3 months ago
VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming
Abstract—Provisioning random access functions in peer-topeer on-demand video streaming is challenging, due to not only the asynchronous user interactivity but also the unpredicta...
Wai-Pun Ken Yiu, Xing Jin, Shueng-Han Gary Chan
131
Voted
APPINF
2003
15 years 4 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar