Sciweavers

5210 search results - page 342 / 1042
» Exact geometric computation
Sort
View
MWCN
2004
Springer
16 years 3 days ago
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and...
Roberto Montemanni, Luca Maria Gambardella
ADCM
2007
168views more  ADCM 2007»
15 years 6 months ago
A generalization of Gram-Schmidt orthogonalization generating all Parseval frames
Given an arbitrary finite sequence of vectors in a finite–dimensional Hilbert space, we describe an algorithm, which computes a Parseval frame for the subspace generated by the...
Peter G. Casazza, Gitta Kutyniok
IJFCS
2006
81views more  IJFCS 2006»
15 years 6 months ago
Combinatorial Properties of Sturmian Palindromes
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
Aldo de Luca, Alessandro De Luca
IPL
2007
104views more  IPL 2007»
15 years 6 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
CORR
1999
Springer
111views Education» more  CORR 1999»
15 years 6 months ago
On Bounded-Weight Error-Correcting Codes
: This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to th...
Russell Bent, Michael Schear, Lane A. Hemaspaandra...