Sciweavers

811 search results - page 144 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
BIBE
2006
IEEE
154views Bioinformatics» more  BIBE 2006»
14 years 2 months ago
Determining Molecular Similarity for Drug Discovery using the Wavelet Riemannian Metric
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
Elinor Velasquez, Emmanuel R. Yera, Rahul Singh
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 1 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 9 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
PAMI
2008
198views more  PAMI 2008»
13 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
PODC
2009
ACM
14 years 9 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...