Sciweavers

563 search results - page 64 / 113
» Computing approximate PSD factorizations
Sort
View
FOCS
2007
IEEE
14 years 4 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
14 years 3 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
ICMCS
2008
IEEE
129views Multimedia» more  ICMCS 2008»
14 years 4 months ago
Evaluation of segment-based proxy caching for video on demand
In this paper, we derive an analytical model for the evaluation of the performance of a Video on Demand (VoD) system. The model estimates the mean waiting time achievable by the P...
Muhammad Muhammad, Wei Tu, Eckehard G. Steinbach
ICPR
2000
IEEE
14 years 2 months ago
X-Ray Volume Rendering by Hierarchical Wavelet Splatting
This paper is concerned with X-ray volume visualization by means of wavelet splatting, a wavelet-based extension to splatting. Wavelet splatting allows multiresolution visualizati...
Michel A. Westenberg, Jos B. T. M. Roerdink
ICIP
1995
IEEE
14 years 1 months ago
Multigrid adaptive image processing
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...
Michael Unser