Sciweavers

10051 search results - page 38 / 2011
» A Dynamic Separator Algorithm
Sort
View
92
Voted
SP
1990
IEEE
15 years 4 months ago
Some Conundrums Concerning Separation of Duty
This paper examines some questions concerning commercial computer security integrity policies. We give an example of a dynamic separation of duty policy which cannot be implemente...
M. J. Nash, K. R. Poland
84
Voted
ICASSP
2007
IEEE
15 years 4 months ago
Multi-Channel Source Separation Preserving Spatial Information
In this paper we propose two novel methods for preserving the spatial information in source separation algorithms. Our approach is applicable to any source separation algorithm an...
Robert Aichner, Herbert Buchner, Meray Zourub, Wal...
81
Voted
GECCO
2004
Springer
15 years 5 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ECOOP
2005
Springer
15 years 6 months ago
Loosely-Separated "Sister" Namespaces in Java
Most modern programming systems such as Java allow us to link independently developed components together dynamically. This makes it possible to develop and deploy software on a pe...
Yoshiki Sato, Shigeru Chiba
PAMI
2007
118views more  PAMI 2007»
14 years 12 months ago
Learning to Transform Time Series with a Few Examples
We describe a semi-supervised regression algorithm that learns to transform one time series into another time series given examples of the transformation. This algorithm is applie...
Ali Rahimi, Ben Recht, Trevor Darrell