1208 search results - page 45 / 242 » Uniform eventown problems |
150
Voted
RT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we present a new shadow mapping technique that improves upon the quality of perspective and uniform shadow maps. Our technique uses a perspective transform specifi...
136
click to vote
CN
2000
15 years 3 months ago
2000
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
131
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
150
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
124
click to vote
SIAMDM
2010
15 years 2 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...