Sciweavers

4110 search results - page 262 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
NIPS
2004
15 years 8 months ago
Sampling Methods for Unsupervised Learning
We present an algorithm to overcome the local maxima problem in estimating the parameters of mixture models. It combines existing approaches from both EM and a robust fitting algo...
Robert Fergus, Andrew Zisserman, Pietro Perona
152
Voted
CAD
2006
Springer
15 years 6 months ago
Geometric constraints within feature hierarchies
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the featu...
Meera Sitharam, Jianjun Oung, Yong Zhou, Adam Arbr...
KAIS
2008
99views more  KAIS 2008»
15 years 6 months ago
Privacy-preserving SVM classification
Classical data mining algorithms implicitly assume complete access to all data, either in centralized or federated form. However, privacy and security concerns often prevent sharin...
Jaideep Vaidya, Hwanjo Yu, Xiaoqian Jiang
BCB
2010
156views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Accelerating HMMER on GPUs by implementing hybrid data and task parallelism
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
16 years 6 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan