Sciweavers

1552 search results - page 116 / 311
» On the Complexity of Constant Propagation
Sort
View
PLDI
1990
ACM
15 years 10 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
ICCV
2007
IEEE
16 years 8 months ago
Accurate Non-Iterative O(n) Solution to the PnP Problem
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
16 years 1 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
FC
2007
Springer
111views Cryptology» more  FC 2007»
16 years 17 days ago
A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting
A multi-coupon (MC) represents a collection of k coupons that a user can redeem to a vendor in exchange for some goods or services. Nguyen (FC 2006), deepening the ideas of Chen et...
Liqun Chen, Alberto N. Escalante, Hans Löhr, ...
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 10 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...