Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
65,030
How many types are there
- Economic Journal
, 2013
"... Abstract We consider an elementary nonparametric (revealed preference) method which will partition consumer microdata into the minimal number of preference types such that the data are perfectly rationalisable by standard utility theory. This provides a simple, theory-driven way of investigating un ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract We consider an elementary nonparametric (revealed preference) method which will partition consumer microdata into the minimal number of preference types such that the data are perfectly rationalisable by standard utility theory. This provides a simple, theory-driven way of investigating
Generating typed dependency parses from phrase structure parses
- IN PROC. INT’L CONF. ON LANGUAGE RESOURCES AND EVALUATION (LREC
, 2006
"... This paper describes a system for extracting typed dependency parses of English sentences from phrase structure parses. In order to capture inherent relations occurring in corpus texts that can be critical in real-world applications, many NP relations are included in the set of grammatical relations ..."
Abstract
-
Cited by 655 (26 self)
- Add to MetaCart
This paper describes a system for extracting typed dependency parses of English sentences from phrase structure parses. In order to capture inherent relations occurring in corpus texts that can be critical in real-world applications, many NP relations are included in the set of grammatical
Ariadne: a secure on-demand routing protocol for ad hoc networks," in
- Proc. 8th ACM International Conf. Mobile Computing Networking ,
, 2002
"... Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing prob ..."
Abstract
-
Cited by 925 (12 self)
- Add to MetaCart
or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.
Characteristics of a human cell line transformed by DNA from human adenovirus type 5
, 1977
"... Human embryonic kidney cells have been transformed by exposing cells to sheared fragments of adenovirus type 5 DNA. The transformed cells (designated 293 cells) exhibited many of the characteristics of transformation including the elaboration of a virus-specific tumour antigen. Analysis of the polyp ..."
Abstract
-
Cited by 676 (14 self)
- Add to MetaCart
Human embryonic kidney cells have been transformed by exposing cells to sheared fragments of adenovirus type 5 DNA. The transformed cells (designated 293 cells) exhibited many of the characteristics of transformation including the elaboration of a virus-specific tumour antigen. Analysis
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
, 2003
"... In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, ..."
Abstract
-
Cited by 609 (41 self)
- Add to MetaCart
In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling
Independent Random Matching with Many Types
, 2010
"... Random matching models with a continuum population are widely used in economics to model decentralized environments. A number of economic models—e.g., in evolutionary game theory and monetary theory—explicitly or implicitly assume pairwise random matching with convenient proportionality and independ ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
many types, which are currently used in the literature without an explicit justification. 1
in Many Types of M-Brane Backgrounds
, 1998
"... We derive superalgebras in many types of supersymmetric M-brane backgrounds. The backgrounds examined here include the cases of the M-wave and the M-Kaluza-Klein monopole. On the basis of the obtained algebras, we deduce all the supersymmetric nonorthogonal intersections of the M-Kaluza-Klein monopo ..."
Abstract
- Add to MetaCart
We derive superalgebras in many types of supersymmetric M-brane backgrounds. The backgrounds examined here include the cases of the M-wave and the M-Kaluza-Klein monopole. On the basis of the obtained algebras, we deduce all the supersymmetric nonorthogonal intersections of the M
Estimation and Inference in Econometrics
, 1993
"... The astonishing increase in computer performance over the past two decades has made it possible for economists to base many statistical inferences on simulated, or bootstrap, distributions rather than on distributions obtained from asymptotic theory. In this paper, I review some of the basic ideas o ..."
Abstract
-
Cited by 1204 (4 self)
- Add to MetaCart
The astonishing increase in computer performance over the past two decades has made it possible for economists to base many statistical inferences on simulated, or bootstrap, distributions rather than on distributions obtained from asymptotic theory. In this paper, I review some of the basic ideas
Featherweight Java: A Minimal Core Calculus for Java and GJ
- ACM Transactions on Programming Languages and Systems
, 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract
-
Cited by 659 (23 self)
- Add to MetaCart
computational “feel, ” providing classes, methods, fields, inheritance, and dynamic typecasts with a semantics closely following Java’s. A proof of type safety for Featherweight Java thus illustrates many of the interesting features of a safety proof for the full language, while remaining pleasingly compact
Generic Schema Matching with Cupid
- In The VLDB Journal
, 2001
"... Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past s ..."
Abstract
-
Cited by 604 (17 self)
- Add to MetaCart
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past
Results 1 - 10
of
65,030
