Sciweavers

777 search results - page 1 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
AUTOMATICA
2000
57views more  AUTOMATICA 2000»
13 years 5 months ago
A fast algorithm for the computation of an upper bound on the µ-norm
Craig T. Lawrence, André L. Tits, Paul Van ...
SEFM
2008
IEEE
13 years 12 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
TIT
2008
61views more  TIT 2008»
13 years 5 months ago
A Probabilistic Upper Bound on Differential Entropy
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
Erik G. Learned-Miller, Joseph DeStefano
FOCS
2000
IEEE
13 years 10 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
CP
2008
Springer
13 years 7 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...