Sciweavers

4926 search results - page 314 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
144
Voted
IPPS
1995
IEEE
15 years 8 months ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha
CVPR
2011
IEEE
15 years 1 months ago
Multiview Registration via Graph Diffusion of Dual Quaternions
Surface registration is a fundamental step in the reconstruction of three-dimensional objects. While there are several fast and reliable methods to align two surfaces, the tools a...
Andrea Torsello, Emanuele Rodola, Andrea Albarelli
160
Voted
BMCBI
2005
114views more  BMCBI 2005»
15 years 4 months ago
A new decoding algorithm for hidden Markov models improves the prediction of the topology of all-beta membrane proteins
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
Piero Fariselli, Pier Luigi Martelli, Rita Casadio
MOBISYS
2006
ACM
16 years 4 months ago
Building realistic mobility models from coarse-grained traces
In this paper we present a trace-driven framework capable of building realistic mobility models for the simulation studies of mobile systems. With the goal of realism, this framew...
Jungkeun Yoon, Brian D. Noble, Mingyan Liu, Minkyo...
CIKM
2010
Springer
15 years 3 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...