Sciweavers

2424 search results - page 254 / 485
» A general algorithm for data dependence analysis
Sort
View
ICIP
2003
IEEE
16 years 5 months ago
Depth of field in light field rendering
This paper focuses on the sampling problem in light field rendering (LFR) that is a fundamental approach to image based rendering. Quality of LFR depends on a light ray database g...
Keita Takahashi, Takeshi Naemura, Hiroshi Harashim...
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 4 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
JCDL
2009
ACM
115views Education» more  JCDL 2009»
15 years 10 months ago
Using timed-release cryptography to mitigate the preservation risk of embargo periods
Due to temporary access restrictions, embargoed data cannot be refreshed to unlimited parties during the embargo time interval. A solution to mitigate the risk of data loss has be...
Rabia Haq, Michael L. Nelson
DAC
1997
ACM
15 years 8 months ago
System Level Fixed-Point Design Based on an Interpolative Approach
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
Markus Willems, Volker Bürsgens, Holger Kedin...
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 6 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan