Results 1  10
of
11,321
REMOVABLE SETS FOR SUBHARMONIC FUNCTIONS
, 2000
"... It is a classical result that a closed exceptional polar set is removable for subharmonic functions which are bounded above. Gardiner has shown that in the case of a compact exceptional set the above boundedness condition can be relaxed by imposing certain smoothness and Hausdorff measure condition ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
It is a classical result that a closed exceptional polar set is removable for subharmonic functions which are bounded above. Gardiner has shown that in the case of a compact exceptional set the above boundedness condition can be relaxed by imposing certain smoothness and Hausdorff measure
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using
Tangential limits and removable sets for weighted Sobolev spaces
 HIROSHIMA MATH. J. 33 (2003), 43–57
, 2003
"... The aim in the present paper is to give a weighted version of Koskela [Ark. Mat. 37 (1999), 291–304] concerning removable sets for Sobolev functions. ..."
Abstract
 Add to MetaCart
The aim in the present paper is to give a weighted version of Koskela [Ark. Mat. 37 (1999), 291–304] concerning removable sets for Sobolev functions.
On removable sets for Sobolev spaces in the plane
 In Essays on Fourier analysis in honor of Elias M
, 1991
"... Let K be a compact subset of ¯ C = R 2 and let K c denote its complement. We say K ∈ HR, K is holomorphically removable, if whenever F: ¯ C → ¯ C is a homeomorphism and F is holomorphic off K, then F is a Möbius transformation. By composing with a Möbius transform, we may assume F(∞) = ∞. The con ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
].) To prove that the sets in question are HR we establish what may be a stronger result. A compact set K is said to be removable for W 1,2 if every f which is continuous on R 2 and in the Sobolev space W 1,2 (K c) (one derivative in L 2 on K c) is also in W 1,2 (R 2). It is a fact that if K is removable for W
Optimal Brain Damage
, 1990
"... We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved sp ..."
Abstract

Cited by 510 (5 self)
 Add to MetaCart
We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved
Basic concepts and taxonomy of dependable and secure computing
 IEEE TDSC
, 2004
"... This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic defin ..."
Abstract

Cited by 779 (6 self)
 Add to MetaCart
definitions are given first. They are then commented upon, and supplemented by additional definitions, which address the threats to dependability and security (faults, errors, failures), their attributes, and the means for their achievement (fault prevention, fault tolerance, fault removal, fault forecasting
Vogels, UNet: a userlevel network interface for parallel and distributed computing, in:
 Proceedings of the 15th ACM Symposium on Operating System Principles, ACM,
, 1995
"... Abstract The UNet communication architecture provides processes with a virtual view of a network device to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from th ..."
Abstract

Cited by 597 (17 self)
 Add to MetaCart
Abstract The UNet communication architecture provides processes with a virtual view of a network device to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from
OpenFlow: Enabling Innovation in Campus Networks
, 2008
"... This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flowtable, and a standardized interface to add and remove flow entries. Our goal is to encourage networking vendors ..."
Abstract

Cited by 718 (84 self)
 Add to MetaCart
This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flowtable, and a standardized interface to add and remove flow entries. Our goal is to encourage networking vendors
Results 1  10
of
11,321