Results 1  10
of
1,842,477
Recognizability Equals Definability for Partial kPaths
, 1996
"... It is wellknown that a language is recognizable iff it is definable in a monadic secondorder logic. The same holds for sets of finite ranked trees (or finite unranked trees, in which case one must use a counting monadic secondorder logic). Courcelle initiated research into the problem of definabi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that the converse also holds. The converse implication was proved for the cases of k = 0; 1; 2; 3. It was also established for families of kconnected partial ktrees. In this thesis, we show that a recognizable family of partial kpaths (graphs of bounded pathwidth) is definable in a counting monadic second
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
UCPOP: A Sound, Complete, Partial Order Planner for ADL
, 1992
"... We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpo ..."
Abstract

Cited by 491 (24 self)
 Add to MetaCart
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove
How Iris Recognition Works
, 2003
"... Algorithms developed by the author for recognizing persons by their iris patterns have now been tested in six field and laboratory trials, producing no false matches in several million comparison tests. The recognition principle is the failure of a test of statistical independence on iris phase st ..."
Abstract

Cited by 495 (4 self)
 Add to MetaCart
Algorithms developed by the author for recognizing persons by their iris patterns have now been tested in six field and laboratory trials, producing no false matches in several million comparison tests. The recognition principle is the failure of a test of statistical independence on iris phase
Crowds: Anonymity for Web Transactions
 ACM Transactions on Information and System Security
, 1997
"... this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf o ..."
Abstract

Cited by 831 (12 self)
 Add to MetaCart
of its members. Web servers are unable to learn the true source of a request because it is equally likely to have originated from any member of the crowd, and even collaborating crowd members cannot distinguish the originator of a request from a member who is merely forwarding the request on behalf
Automatic Acquisition of Hyponyms from Large Text Corpora
, 1992
"... We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidante of the need for preencoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexicosyntactic patterns that are ..."
Abstract

Cited by 1234 (4 self)
 Add to MetaCart
that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also he acquirable iu this way. A subset of the acquisitiou
Fast Planning Through Planning Graph Analysis
 ARTIFICIAL INTELLIGENCE
, 1995
"... We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid pla ..."
Abstract

Cited by 1165 (3 self)
 Add to MetaCart
We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint
Federated database systems for managing distributed, heterogeneous, and autonomous databases
 ACM Computing Surveys
, 1990
"... A federated database system (FDBS) is a collection of cooperating database systems that are autonomous and possibly heterogeneous. In this paper, we define a reference architecture for distributed database management systems from system and schema viewpoints and show how various FDBS architectures c ..."
Abstract

Cited by 1209 (34 self)
 Add to MetaCart
A federated database system (FDBS) is a collection of cooperating database systems that are autonomous and possibly heterogeneous. In this paper, we define a reference architecture for distributed database management systems from system and schema viewpoints and show how various FDBS architectures
Does Social Capital Have an Economic Payoff? A CrossCountry Investigation
 Quarterly Journal of Economics
, 1997
"... This paper presents evidence that “social capital ” matters for measurable economic performance, using indicators of trust and civic norms from the World Values Surveys for a sample of 29 market economies. Memberships in formal groups—Putnam’s measure of social capital—is not associated with trust o ..."
Abstract

Cited by 1335 (8 self)
 Add to MetaCart
or with improved economic performance. We find trust and civic norms are stronger in nations with higher and more equal incomes, with institutions that restrain predatory actions of chief executives, and with bettereducated and ethnically homogeneous populations. I.
Results 1  10
of
1,842,477