Sciweavers

329 search results - page 46 / 66
» New lower bounds for some spherical designs
Sort
View
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 1 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
VLSID
2006
IEEE
153views VLSI» more  VLSID 2006»
14 years 7 months ago
An Asynchronous Interconnect Architecture for Device Security Enhancement
We present a new style of long-distance, on-chip interconnect, based loosely on the asynchronous GasP architecture. It has a number of advantages over conventional designs, the mo...
Simon Hollis, Simon W. Moore
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
14 years 1 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
13 years 7 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
PLDI
2012
ACM
11 years 9 months ago
Language-based control and mitigation of timing channels
We propose a new language-based approach to mitigating timing channels. In this language, well-typed programs provably leak only a bounded amount of information over time through ...
Danfeng Zhang, Aslan Askarov, Andrew C. Myers