Sciweavers

6110 search results - page 844 / 1222
» Approximate Computing
Sort
View
IVC
2000
179views more  IVC 2000»
15 years 6 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
IPPS
2005
IEEE
16 years 8 days ago
A Robust Interference Model for Wireless Ad-Hoc Networks
Among the foremost goals of topology control in wireless ad-hoc networks is interference reduction. This paper presents a receiver-centric interference model featuring two main ad...
Pascal von Rickenbach, Stefan Schmid, Roger Watten...
168
Voted
CGF
2004
94views more  CGF 2004»
15 years 6 months ago
Hardware-Accelerated Rendering of Photo Hulls
This paper presents an efficient hardware-accelerated method for novel view synthesis from a set of images or videos. Our method is based on the photo hull representation, which i...
Ming Li, Marcus A. Magnor, Hans-Peter Seidel
IMC
2010
ACM
15 years 4 months ago
On economic heavy hitters: shapley value analysis of 95th-percentile pricing
Cost control for the Internet access providers (AP) influences not only the nominal speeds offered to the customers, but also other, more controversial, policies related to traffi...
Rade Stanojevic, Nikolaos Laoutaris, Pablo Rodrigu...
IM
2007
15 years 6 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang