Sciweavers

4886 search results - page 652 / 978
» Approximate Data Exchange
Sort
View
TSP
2010
15 years 1 months ago
Variance-component based sparse signal reconstruction and model selection
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
Kun Qiu, Aleksandar Dogandzic
ICALP
2011
Springer
14 years 10 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
CGF
2008
157views more  CGF 2008»
15 years 6 months ago
Interactive Volume Rendering with Dynamic Ambient Occlusion and Color Bleeding
We propose a method for rendering volumetric data sets at interactive frame rates while supporting dynamic ambient occlusion as well as an approximation to color bleeding. In cont...
Timo Ropinski, Jennis Meyer-Spradow, Stefan Diepen...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 5 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang