727 search results - page 113 / 146 » One line and n points |
136
click to vote
HPCC
2007
Springer
16 years 6 days ago
2007
Springer
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...
139
click to vote
MSWIM
2006
ACM
16 years 19 hour ago
2006
ACM
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...
151
click to vote
CCCG
2006
15 years 7 months ago
2006
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes-bandwidth- and power-limited--have proven indispensable in the design...
153
click to vote
SIAMSC
2008
15 years 6 months ago
2008
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...