Sciweavers

6365 search results - page 344 / 1273
» Fast Local Computation Algorithms
Sort
View
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
16 years 26 days ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
16 years 25 days ago
Anatomically-Aware, Automatic, and Fast Registration of 3D Ear Impression Models
We present a registration framework based on feature points of anatomical 3D shapes represented in the point cloud domain. Anatomical information is utilized throughout the comple...
Alexander Zouhar, Tong Fang, Gozde B. Unal, Gregor...
IFIP
1999
Springer
15 years 11 months ago
Frontier: A Fast Placement System for FPGAs
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-...
Russell Tessier
ICCAD
1994
IEEE
76views Hardware» more  ICCAD 1994»
15 years 11 months ago
An efficient procedure for the synthesis of fast self-testable controller structures
The BIST implementation of a conventionally synthesized controller in most cases requires the integration of an additional register only for test purposes. This leads to some seri...
Sybille Hellebrand, Hans-Joachim Wunderlich
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
15 years 10 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...