Sciweavers

2542 search results - page 311 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
103
Voted
IACR
2011
87views more  IACR 2011»
14 years 7 hour ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao
ICIP
2005
IEEE
15 years 6 months ago
Complexity-aware live streaming system
Multimedia streaming is one of the most attractive services over the Internet, for which bandwidth is a primary constraint. For live streaming, however, the computational resource ...
Meng-Ting Lu, Chang-Kuan Lin, Jason Yao, Homer H. ...
ICS
2003
Tsinghua U.
15 years 5 months ago
Enhancing memory level parallelism via recovery-free value prediction
—The ever-increasing computational power of contemporary microprocessors reduces the execution time spent on arithmetic computations (i.e., the computations not involving slow me...
Huiyang Zhou, Thomas M. Conte
84
Voted
RECOMB
2010
Springer
15 years 7 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
CVPR
2005
IEEE
16 years 2 months ago
A Bayesian Approach to Unsupervised Feature Selection and Density Estimation Using Expectation Propagation
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
Shaorong Chang, Nilanjan Dasgupta, Lawrence Carin