Sciweavers

5100 search results - page 576 / 1020
» The Linear Complexity of a Graph
Sort
View
CISS
2008
IEEE
16 years 1 months ago
Costas array generator polynomials in finite fields
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
James K. Beard
ICASSP
2008
IEEE
16 years 1 months ago
Fast perfect weighted resampling
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
Bart Massey
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
16 years 1 months ago
On the semantics and evaluation of top-k queries in probabilistic databases
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
Xi Zhang, Jan Chomicki
ICALT
2007
IEEE
16 years 1 months ago
Teaching Science subjects to Blind Students
Access to the disciplines of science, Technology, Engineering and Mathematics (STEM) for blind and vision impaired people continues to be a problem. The inherently visual nature o...
Donal Fitzpatrick
ISCAS
2007
IEEE
371views Hardware» more  ISCAS 2007»
16 years 1 months ago
FIR Filter Approximation by IIR Filters Based on Discrete-Time Vector Fitting
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
Ngai Wong, Chi-Un Lei