Sciweavers

1282 search results - page 103 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
FSTTCS
2003
Springer
15 years 7 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
IJHPCA
2010
84views more  IJHPCA 2010»
15 years 25 days ago
Operation Stacking for Ensemble Computations With Variable Convergence
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...
Mehmet Belgin, Godmar Back, Calvin J. Ribbens
WWW
2010
ACM
15 years 9 months ago
Exploiting social context for review quality prediction
Online reviews in which users publish detailed commentary about their experiences and opinions with products, services, or events are extremely valuable to users who rely on them ...
Yue Lu, Panayiotis Tsaparas, Alexandros Ntoulas, L...
CORR
2011
Springer
204views Education» more  CORR 2011»
14 years 8 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
144
Voted
EH
2002
IEEE
139views Hardware» more  EH 2002»
15 years 7 months ago
Evolving Cellular Automata to Model Fluid Flow in Porous Media
Fluid flow in porous media is a dynamic process that is traditionally modeled using PDE (Partial Differential Equations). In this approach, physical properties related to fluid fl...
Tina Yu, Seong Lee