Sciweavers

1995 search results - page 130 / 399
» What's the Problem
Sort
View
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
15 years 3 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
RE
2002
Springer
15 years 3 months ago
Security Requirements Engineering: When Anti-Requirements Hit the Fan
Everyone agrees that security is a problem, ranging from Microsoft to the banks that have been recent victims of rogue traders. What is paradoxical is that there does not seem to ...
Robert Crook, Darrel C. Ince, Luncheng Lin, Bashar...
OL
2010
104views more  OL 2010»
15 years 2 months ago
On representations of the feasible set in convex optimization
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
Jean B. Lasserre
AIEDAM
2010
152views more  AIEDAM 2010»
15 years 1 months ago
A content account of creative analogies in biologically inspired design
The growing movement of biologically inspired design is driven in part by the need for sustainable development and in part by the recognition that nature could be a source of inno...
Swaroop Vattam, Michael E. Helms, Ashok K. Goel
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 11 months ago
On the Zero-Error Capacity Threshold for Deletion Channels
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
Ian A. Kash, Michael Mitzenmacher, Justin Thaler, ...