Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
395
Decentralized Trust Management
- In Proceedings of the 1996 IEEE Symposium on Security and Privacy
, 1996
"... We identify the trust management problem as a distinct and important component of security in network services. Aspects of the trust management problem include formulating security policies and security credentials, determining whether particular sets of credentials satisfy the relevant policies, an ..."
Abstract
-
Cited by 1025 (24 self)
- Add to MetaCart
, and deferring trust to third parties. Existing systems that support security in networked applications, including X.509 and PGP, address only narrow subsets of the overall trust management problem and often do so in a manner that is appropriate to only one application. This paper presents a comprehensive
Admissible Graph Rewriting and Narrowing
- IN PROCEEDINGS OF THE JOINT INTERNATIONAL CONFERENCE AND SYMPOSIUM ON LOGIC PROGRAMMING
, 1998
"... We address the problem of graph rewriting and narrowing as the underlying operational semantics of rule-based programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructor-based graph rewriting systems. For this purpose, we first char ..."
Abstract
-
Cited by 35 (10 self)
- Add to MetaCart
We address the problem of graph rewriting and narrowing as the underlying operational semantics of rule-based programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructor-based graph rewriting systems. For this purpose, we first
Narrowing data-structures with pointers
- In Proceedings of ICGT (International Conference of Graph Transformation). Springer LNCS 4178
, 2006
"... Abstract. We investigate the narrowing relation in a wide class of (cyclic) term-graph rewrite systems. We propose a new sound and complete narrowing-based algorithm able to solve goals in presence of data structures with pointers (e.g., circular lists, doubly linked lists etc.). We first define the ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
Abstract. We investigate the narrowing relation in a wide class of (cyclic) term-graph rewrite systems. We propose a new sound and complete narrowing-based algorithm able to solve goals in presence of data structures with pointers (e.g., circular lists, doubly linked lists etc.). We first define
Acquisition of Narrow Focus Prosody
- Proceedings of the GALA '97 conference: Language Acquisition, Knowledge Representation & Processing
, 1997
"... In English, broad and late narrow focus have identical accent patterns: Pitch accents are aligned with the last accentable constituent within an intonation contour. Under early narrow focus, the pitch accent is claimed to shift to an earlier location and the last accentable syllable is deaccented. T ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In English, broad and late narrow focus have identical accent patterns: Pitch accents are aligned with the last accentable constituent within an intonation contour. Under early narrow focus, the pitch accent is claimed to shift to an earlier location and the last accentable syllable is deaccented
ON THE SPECTRUM OF NARROW OPERATORS
"... Narrow operators were introduced and considered by A. Plichko and M. Popov in [5] acting from a symmetric function space E to a Banach space (or, more general, to an F-space) X. To some extend, this notion generalizes compact operators, still having some of their properties. Then narrow operators we ..."
Abstract
- Add to MetaCart
on an atomless σ-finite measure space (Ω,Σ, µ). Let there exists a purely atomic sub-σ-algebra F ⊆ Σ with Ω ∈ F such that the conditional expectation operator M(·/F) : E → E is correctly defined and bounded. Then a subset K ⊂ C is the spectrum of some narrow operator T: E → E if and only if K is a compact set
Narrow coverings of ω-ary product spaces
- Ann. Pure Appl. Logic
, 1997
"... Abstract. Results of Sierpiński and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is “narrow ” in a corresponding direction; that is, each line in that direction intersects the subset in a small set. For example, if the set ω × ω is ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. Results of Sierpiński and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is “narrow ” in a corresponding direction; that is, each line in that direction intersects the subset in a small set. For example, if the set ω × ω
Lipschitz class, narrow class, and counting lattice points
"... Abstract. A well known principle says that the number of lattice points in a bounded subsets S of Euclidean space is about the ratio of the volume and the lattice determinant, subject to some relatively mild conditions on S. In the literature one finds two different types of such conditions; one ass ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
Abstract. A well known principle says that the number of lattice points in a bounded subsets S of Euclidean space is about the ratio of the volume and the lattice determinant, subject to some relatively mild conditions on S. In the literature one finds two different types of such conditions; one
PROPERTIES OF NARROW CORONAL MASS EJECTIONS OBSERVED WITH LASCO
"... We report the statistical properties of narrow coronal mass ejections (CMEs, angular width < 20◦) with particular emphasis on comparison with normal CMEs. We investigated 806 narrow CMEs from an online LASCO/CME catalog and found that (1) the fraction of narrow CMEs increases from 12 % to 22 % to ..."
Abstract
- Add to MetaCart
% towards solar maximum, (2) during the solar maximum, the narrow CMEs are generally faster than normal ones, (3) the maximum speed of narrow CMEs (1141 km s−1) is much smaller than that of the normal CMEs (2604 km s−1). These results imply that narrow CMEs do not form a subset of normal CMEs and have a
Narrow–line AGN in the ISO–2MASS Survey ⋆
, 2007
"... Received; accepted Context. A long–standing challenge of observational AGN research is to find type 2 quasars, the luminous analogues of Seyfert–2 galaxies. Aims. We search for luminous narrow–line type 2 AGN, characterise their properties, and compare them with broad–line type 1 AGN. Methods. Combi ..."
Abstract
- Add to MetaCart
Received; accepted Context. A long–standing challenge of observational AGN research is to find type 2 quasars, the luminous analogues of Seyfert–2 galaxies. Aims. We search for luminous narrow–line type 2 AGN, characterise their properties, and compare them with broad–line type 1 AGN. Methods
Semantic Image Search and Subset Selection for Classifier Training
- in Object Recognition, Progress in Artificial Intelligence: 14th Portuguese Conference on Artificial Intelligence, EPIA 2009
"... Abstract. Robots need to ground their external vocabulary and internal symbols in observations of the world. In recent works, this problem has been approached through combinations of open-ended category learning and interaction with other agents acting as teachers. In this paper, a complementary pat ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
, namely global shape contexts to represent broad categories, and SIFT local features to represent narrow categories. An unsupervised image clustering and ranking method is proposed that, starting from a set of images automatically fetched on the web for a given category name, selects a subset of images
Results 1 - 10
of
395
