Results 1  10
of
776,960
ON THE DERIVATION OF PARTIALLY CONNECTED SUBSETS
"... Abstract. Let Y ′ ′ be a pseudoMaxwell–von Neumann prime. Recent developments in quantum calculus [6, 18] have raised the question of whether i ′> ∅. We show that Banach’s conjecture is true in the context of graphs. It would be interesting to apply the techniques of [6] to scalars. In this cont ..."
Abstract
 Add to MetaCart
Abstract. Let Y ′ ′ be a pseudoMaxwell–von Neumann prime. Recent developments in quantum calculus [6, 18] have raised the question of whether i ′> ∅. We show that Banach’s conjecture is true in the context of graphs. It would be interesting to apply the techniques of [6] to scalars. In this context, the results of [18] are highly relevant. 1.
Wrappers for Feature Subset Selection
 AIJ SPECIAL ISSUE ON RELEVANCE
, 1997
"... In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention, while ignoring the rest. To achieve the best possible performance with a particular learning algorithm on a particular training set, a ..."
Abstract

Cited by 1522 (3 self)
 Add to MetaCart
In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention, while ignoring the rest. To achieve the best possible performance with a particular learning algorithm on a particular training set
THE HYPERSPACE OF CLOSED CONNECTED SUBSETS OF A EUCLIDEAN SPACE
"... Abstract. Let R n denote ndimensional Euclidean space and C(R n) denote the hyperspace of closed connected subsets of R n, with the Vietoris topology. The following results are obtained: (1) C(R 1) is homeomorphic to R 1 × [0, 1] and hence is locally compact; (2) If n ≥ 2 and A ∈ C(R n), then C(R n ..."
Abstract
 Add to MetaCart
Abstract. Let R n denote ndimensional Euclidean space and C(R n) denote the hyperspace of closed connected subsets of R n, with the Vietoris topology. The following results are obtained: (1) C(R 1) is homeomorphic to R 1 × [0, 1] and hence is locally compact; (2) If n ≥ 2 and A ∈ C(R n), then C
Probabilistic Routing in Intermittently Connected Networks
 SIGMOBILE Mobile Computing and Communication Review
, 2004
"... In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does ..."
Abstract

Cited by 633 (6 self)
 Add to MetaCart
In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts
A formal basis for architectural connection
 ACM TRANSACTIONS ON SOJIWARE ENGINEERING AND METHODOLOGY
, 1997
"... ..."
A Spatial Logic based on Regions and Connection
 PROCEEDINGS 3RD INTERNATIONAL CONFERENCE ON KNOWLEDGE REPRESENTATION AND REASONING
, 1992
"... We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its us ..."
Abstract

Cited by 736 (32 self)
 Add to MetaCart
We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its useful expressiveness. An axiomatisation of the new theory and a comparison with the two original theories is given.
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 498 (68 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System
 In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles
, 1995
"... Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting apph ..."
Abstract

Cited by 506 (14 self)
 Add to MetaCart
Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting
Results 1  10
of
776,960