Sciweavers

1095 search results - page 198 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
84
Voted
PODC
2010
ACM
15 years 6 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
TC
2010
15 years 18 days ago
Network-on-Chip Hardware Accelerators for Biological Sequence Alignment
—The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially ...
Souradip Sarkar, Gaurav Ramesh Kulkarni, Partha Pr...
DCOSS
2007
Springer
15 years 8 months ago
Separating the Wheat from the Chaff: Practical Anomaly Detection Schemes in Ecological Applications of Distributed Sensor Networ
Abstract. We develop a practical, distributed algorithm to detect events, identify measurement errors, and infer missing readings in ecological applications of wireless sensor netw...
Luís M. A. Bettencourt, Aric A. Hagberg, Le...
CVPR
2006
IEEE
16 years 4 months ago
Groupwise point pattern registration using a novel CDF-based Jensen-Shannon Divergence
In this paper, we propose a novel and robust algorithm for the groupwise non-rigid registration of multiple unlabeled point-sets with no bias toward any of the given pointsets. To...
Fei Wang, Baba C. Vemuri, Anand Rangarajan
ASM
2004
ASM
15 years 7 months ago
Intra-step Interaction
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
Yuri Gurevich