Sciweavers

6365 search results - page 105 / 1273
» Fast Local Computation Algorithms
Sort
View
116
Voted
E2EMON
2006
IEEE
15 years 8 months ago
Active Probing Approach for Fault Localization in Computer Networks
—Active probing is an active network monitoring technique that has potential for developing effective solutions for fault localization. In this paper we use active probing to pre...
Maitreya Natu, Adarshpal S. Sethi
112
Voted
NAR
2008
73views more  NAR 2008»
15 years 2 months ago
LocalMove: computing on-lattice fits for biopolymers
Given an input Protein Data Bank file (PDB) for a protein or RNA molecule, LocalMove is a web server that determines an on-lattice representation for the input biomolecule. The we...
Yann Ponty, R. Istrate, E. Porcelli, Peter Clote
CSIE
2009
IEEE
15 years 7 months ago
A Fast Algorithm of Image Layer-Presentation
A new algorithm of image layer-presentation was proposed. The key concept of the algorithm was in that the image grayscale function f(x,y), which was comparatively irregular, was ...
Fang-Zhen Li, Zhi Gong, Xiao-Hong Shen, Nian Cai
159
Voted
ICIP
2002
IEEE
16 years 4 months ago
A fast back-projection algorithm for bistatic SAR imaging
Using a far-field model, bistatic synthetic aperture radar (SAR) acquires Fourier data on a rather unusual, non-Cartesian grid in the Fourier domain. Previous image formation algo...
Yu Ding, David C. Munson Jr.
PODC
1996
ACM
15 years 6 months ago
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
Maged M. Michael, Michael L. Scott