13214 search results - page 361 / 2643 » Pseudorandomness for network algorithms |
168
click to vote
PDPTA
2007
15 years 8 months ago
2007
- Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memo...
228
click to vote
PR
2011
15 years 1 months ago
2011
Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurrin...
156
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
— This paper presents two contributions. The first is an incremental placement algorithm for placement-aware logic synthesis along with a proof of optimality. The algorithm can ...
214
click to vote
EPEW
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Distributed security models based on a ‘web of trust’ eliminate single points of failure and alleviate performance bottlenecks. However, such distributed approaches r...
187
click to vote
AINA
2006
IEEE
16 years 27 days ago
2006
IEEE
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...