Sciweavers

1749 search results - page 239 / 350
» Conditional colorings of graphs
Sort
View
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
ICCV
2003
IEEE
16 years 8 months ago
Adaptive Dynamic Range Imaging: Optical Control of Pixel Exposures Over Space and Time
This paper presents a new approach to imaging that significantly enhances the dynamic range of a camera. The key idea is to adapt the exposure of each pixel on the image detector,...
Shree K. Nayar, Vlad Branzoi
ACMSE
2005
ACM
16 years 10 days ago
Alert confidence fusion in intrusion detection systems with extended Dempster-Shafer theory
Accurate identification of misuse is a key factor in determining appropriate ways to protect systems. Modern intrusion detection systems often use alerts from different sources su...
Dong Yu, Deborah A. Frincke
SIGGRAPH
2000
ACM
15 years 11 months ago
The digital Michelangelo project: 3D scanning of large statues
We describe a hardware and software system for digitizing the shape and color of large fragile objects under non-laboratory conditions. Our system employs laser triangulation rang...
Marc Levoy, Kari Pulli, Brian Curless, Szymon Rusi...
VISUALIZATION
1998
IEEE
15 years 11 months ago
Eliminating popping artifacts in sheet buffer-based splatting
Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main va...
Klaus Mueller, Roger Crawfis