Sciweavers

5580 search results - page 613 / 1116
» Randomized priority algorithms
Sort
View
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 9 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
AINA
2004
IEEE
15 years 8 months ago
RED with Optimized Dynamic Threshold Deployment on Shared Buffer
Prior survey of RED algorithm deployment on multiqueue system with shared buffer was unfair and sensitive to congestion level by statically setting the parameters. In this paper, ...
Chengchen Hu, Bin Liu
ICPR
2010
IEEE
15 years 8 months ago
Scene Text Extraction with Edge Constraint and Text Collinearity
In this paper, we propose a framework for isolating text regions from natural scene images. The main algorithm has two functions: it generates text region candidates, and it veriļ...
Seonghun Lee, Kyomin Jung, Jin Hyung Kim
138
Voted
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
15 years 8 months ago
Synthesis-for-testability using transformations
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...
Miodrag Potkonjak, Sujit Dey, Rabindra K. Roy
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 7 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff