5210 search results - page 669 / 1042 » Exact geometric computation |
102
click to vote
AAECC
2007
Springer
15 years 10 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
147
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
150
click to vote
WAW
2007
Springer
15 years 10 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
149
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
133
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...