Results 1  10
of
78,799
Safe Kernel Extensions Without RunTime Checking
 Proc. of OSDI'96
"... Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a safety policy and makes it public. Then, using this policy, an application can provide binaries i ..."
Abstract

Cited by 427 (20 self)
 Add to MetaCart
assembly language, and then generated PCC binaries for them using a special prototype assembler. The PCC binaries can be executed with no runtime overhead, beyond a onetime cost of 1 to 3 milliseconds for validating the enclosed proofs. The net result is that our packet filters are formally guaranteed
Enclose it or Lose it! Computeraided Proofs in Statistics
, 2010
"... Enclosure methods are a class of computeraided proofs used in analysis. They are used increasingly to solve open problems in mathematics. The proposed project will use enclosure methods to address two open statistical decision problems: 1. rigorous parameter estimation in a chaotic statistical expe ..."
Abstract
 Add to MetaCart
Enclosure methods are a class of computeraided proofs used in analysis. They are used increasingly to solve open problems in mathematics. The proposed project will use enclosure methods to address two open statistical decision problems: 1. rigorous parameter estimation in a chaotic statistical
On the smallest enclosing information disk
, 2006
"... In this paper, we present a generalization of the smallest enclosing disk problem for point sets lying in Informationgeometric spaces. Given a set of vector points equipped with a (dis)similarity measure that is not necessarily the Euclidean distance, we investigate the problem of finding its cente ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
In this paper, we present a generalization of the smallest enclosing disk problem for point sets lying in Informationgeometric spaces. Given a set of vector points equipped with a (dis)similarity measure that is not necessarily the Euclidean distance, we investigate the problem of finding its
ON THE SMALLEST ENCLOSING BALLS ∗
"... Abstract. In the paper a theoretical analysis is given for the smallest ball that covers a finite number of points p1, p2, · · · , pN ∈ R n. Several fundamental properties of the smallest enclosing ball are described and proved. Particularly, it is proved that the kcircumscribing enclosing ball ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. In the paper a theoretical analysis is given for the smallest ball that covers a finite number of points p1, p2, · · · , pN ∈ R n. Several fundamental properties of the smallest enclosing ball are described and proved. Particularly, it is proved that the kcircumscribing enclosing ball
Group Enclosing Queries
 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
"... Given a set of points P and a query set Q, a group enclosing query (GEQ) fetches the point p ∗ ∈ P such that the maximum distance of p ∗ to all points in Q is minimized. This problem is equivalent to the MinMax case (minimizing the maximum distance) of aggregate nearest neighbor queries for spatia ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Given a set of points P and a query set Q, a group enclosing query (GEQ) fetches the point p ∗ ∈ P such that the maximum distance of p ∗ to all points in Q is minimized. This problem is equivalent to the MinMax case (minimizing the maximum distance) of aggregate nearest neighbor queries
Father's Full Name _____________________________________________________ Mother's Full Name_____________________________________________________
, 2009
"... Enclose official transcripts College/University you will be attending Fall 2009 (if you are not currently enrolled, please enclose proof of acceptance) ..."
Abstract
 Add to MetaCart
Enclose official transcripts College/University you will be attending Fall 2009 (if you are not currently enrolled, please enclose proof of acceptance)
Acoustic imaging in enclosed spaces
, 2015
"... To cite this version: Antonio Pereira. Acoustic imaging in enclosed spaces. Acoustics [physics.classph]. INSA de ..."
Abstract
 Add to MetaCart
To cite this version: Antonio Pereira. Acoustic imaging in enclosed spaces. Acoustics [physics.classph]. INSA de
Enclosing Solutions of Integral Equations
, 1995
"... this paper is the set of all functions y for which the integral of (1) exists. This set is denoted by F ([a; b]). A function interval Y is an interval of functions in F ([a; b]), Y = [y; y] = fy 2 F ([a; b]) j 8t 2 [a; b] : y(t) y(t) y(t)g ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
this paper is the set of all functions y for which the integral of (1) exists. This set is denoted by F ([a; b]). A function interval Y is an interval of functions in F ([a; b]), Y = [y; y] = fy 2 F ([a; b]) j 8t 2 [a; b] : y(t) y(t) y(t)g
Results 1  10
of
78,799