Sciweavers

6365 search results - page 251 / 1273
» Fast Local Computation Algorithms
Sort
View
CSR
2010
Springer
15 years 11 months ago
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
Pawel Gawrychowski, Artur Jez, Lukasz Jez
ARITH
2011
IEEE
14 years 6 months ago
Fast Ripple-Carry Adders in Standard-Cell CMOS VLSI
— This paper presents a number of new high-radix ripple-carry adder designs based on Ling’s addition technique and a recently-published expansion thereof. The proposed adders a...
Neil Burgess
ISCA
2008
IEEE
113views Hardware» more  ISCA 2008»
16 years 1 months ago
A Two-Level Load/Store Queue Based on Execution Locality
Multicore processors have emerged as a powerful platform on which to efficiently exploit thread-level parallelism (TLP). However, due to Amdahl’s Law, such designs will be incr...
Miquel Pericàs, Adrián Cristal, Fran...
ICASSP
2011
IEEE
14 years 10 months ago
Optimal wireless networks based on local channel state information
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Yichuan Hu, Alejandro Ribeiro
COMPUTING
2006
112views more  COMPUTING 2006»
15 years 6 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts