2766 search results - page 417 / 554 » Algorithms for trigonometric polynomials |
178
click to vote
SMA
2009
ACM
15 years 10 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
138
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
135
Voted
ADHOCNOW
2008
Springer
15 years 10 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
156
click to vote
COMSWARE
2007
IEEE
15 years 10 months ago
2007
IEEE
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
123
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. Recently, one such great challenge has been the development...