14704 search results - page 476 / 2941 » computing 2007 |
175
Voted
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
143
click to vote
ITNG
2007
IEEE
16 years 14 days ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
157
click to vote
CAD
2007
Springer
15 years 6 months ago
2007
Springer
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
224
click to vote
ISCA
2007
IEEE
15 years 6 months ago
2007
IEEE
Hyperspectral sensors represent the most advanced instruments currently available for remote sensing of the Earth. The high spatial and spectral resolution of the images supplied ...
178
click to vote
P2P
2008
IEEE
16 years 17 days ago
2008
IEEE
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...