3897 search results - page 330 / 780 » complexity 2010 |
158
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
154
click to vote
IWCMC
2010
ACM
15 years 11 months ago
2010
ACM
This paper focuses on turbo packet combining techniques for multi-relay-assisted systems operating over multiple-input multiple-output (MIMO) broadband channel. Two packet combini...
151
click to vote
MSR
2010
ACM
15 years 11 months ago
2010
ACM
Abstract—Reliably predicting software defects is one of software engineering’s holy grails. Researchers have devised and implemented a plethora of bug prediction approaches var...
151
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
203
Voted
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
We present a robust approach to creating 2.5D building models from aerial LiDAR point clouds. The method is guaranteed to produce crack-free models composed of complex roofs and ve...