Sciweavers

1672 search results - page 16 / 335
» Tightness problems in the plane
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
DCC
2005
IEEE
14 years 7 months ago
Real, Tight Frames with Maximal Robustness to Erasures
Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We a...
Jelena Kovacevic, Markus Püschel
CSFW
2009
IEEE
14 years 2 months ago
Tight Enforcement of Information-Release Policies for Dynamic Languages
This paper studies the problem of securing information release in dynamic languages. We propose (i) an intuitive framework for information-release policies expressing both what ca...
Aslan Askarov, Andrei Sabelfeld
APPML
2002
58views more  APPML 2002»
13 years 7 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar