Sciweavers

1523 search results - page 248 / 305
» Partially ordered secretaries
Sort
View
107
Voted
SIAMAM
2008
102views more  SIAMAM 2008»
15 years 16 days ago
Ostwald Ripening in Thin Film Equations
Fourth order thin film equations can have late stage dynamics that arise in a fashion analogous to the classical Cahn Hilliard equation. Profound differences arise however, both b...
Karl B. Glasner
TCS
2008
15 years 16 days ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
JC
2007
94views more  JC 2007»
15 years 16 days ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
88
Voted
JMLR
2007
101views more  JMLR 2007»
15 years 15 days ago
Noise Tolerant Variants of the Perceptron Algorithm
A large number of variants of the Perceptron algorithm have been proposed and partially evaluated in recent work. One type of algorithm aims for noise tolerance by replacing the l...
Roni Khardon, Gabriel Wachman
94
Voted
TWC
2008
125views more  TWC 2008»
15 years 15 days ago
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
Abstract--In this paper, we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the ...
Ahmed S. Ibrahim, Ahmed K. Sadek, Weifeng Su, K. J...