Sciweavers

147 search results - page 23 / 30
» Partitioning procedure for polynomial optimization
Sort
View
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 10 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
MOBIHOC
2008
ACM
14 years 9 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICIP
2007
IEEE
14 years 4 months ago
Universal Camera Calibration with Automatic Distortion Model Selection
We present an optimized full scale automatic camera calibration approach which is both accurate and simple to implement. The method can be applied to a wide range of cameras equip...
Vitaly Orekhov, Besma R. Abidi, Christopher Broadd...
IPL
2010
114views more  IPL 2010»
13 years 8 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
IACR
2011
212views more  IACR 2011»
12 years 9 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...