2766 search results - page 399 / 554 » Algorithms for trigonometric polynomials |
128
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
153
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
139
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
141
click to vote
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
139
click to vote
CPM
2000
Springer
15 years 8 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...