5639 search results - page 289 / 1128 » Timed Abstract Non-interference |
104
click to vote
DCC
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
111
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
153
Voted
SWAT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
105
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We prove that a controllable set of smooth trajectories is the solution set of a constant coefficient linear differential equation if and only if it is linear, time in...
131
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...