1066 search results - page 51 / 214 » Computing Private Set Operations with Linear Complexities |
76
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper we discuss rate control for multiuser multicarrier systems, where the transmitter has a single antenna and is subject to a PSD mask limitation while the receiver has...
ISVC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Computer assisted procedures play a key role in the improvement of surgical operations. The current techniques in simulation potentially lead to more accuracy, more safet...
100
click to vote
AISC
2010
Springer
15 years 2 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...