Results 1 - 10 of 774

The Generative Lexicon

by James Pustejovsky - Computational Linguistics , 1991
"... this paper, I will discuss four major topics relating to current research in lexical semantics: methodology, descriptive coverage, adequacy of the representation, and the computational usefulness of representations. In addressing these issues, I will discuss what I think are some of the central prob ..."
Abstract - Cited by 1341 (45 self) - Add to MetaCart
of semantic description, where the semantic load is spread more evenly throughout the lexicon. I argue that lexical decomposition is possible if it is performed generatively. Rather than assuming a fixed set of primitives, I will assume a fixed number of generative devices that can be seen as constructing

VL2: Scalable and Flexible Data Center Network”,

by Albert Greenberg , James R Hamilton , Navendu Jain , Srikanth Kandula , Changhoon Kim , Parantap Lahiri , David A Maltz , Parveen Patel , Sudipta Sengupta - ACM SIGCOMM Computer Communication Review, , 2009
"... Abstract To be agile and cost e ective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL, a practical network architecture that scales t ..."
Abstract - Cited by 461 (12 self) - Add to MetaCart
to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer- semantics. VL uses () at addressing to allow service instances to be placed anywhere in the network, () Valiant Load Balancing to spread tra c uniformly across network

COMA - A system for flexible combination of Schema Matching Approaches

by Hong-hai Do, Erhard Rahm - In VLDB , 2002
"... Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data sources, data warehouse loading and XML message mapping. To reduce the amount of user effort as much as possible, automati ..."
Abstract - Cited by 443 (12 self) - Add to MetaCart
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data sources, data warehouse loading and XML message mapping. To reduce the amount of user effort as much as possible

EFFECTIVE ESTIMATION OF CONTEXT SIMILARITY: A PROPOSED MATCHING MODEL BASED ON WEIGHTED SEMANTIC LOAD

by Mehdi Mohammadi , S M Fakhrahmad
"... ABSTRACT In this paper, we propose a new model to calculate the similarity of two sentences. The proposed scheme is based on the amount of semantic load which is shared between two sentences. Since verb is the essential part of a sentence, the main focus of the proposed model is on the verbs of two ..."
Abstract - Add to MetaCart
ABSTRACT In this paper, we propose a new model to calculate the similarity of two sentences. The proposed scheme is based on the amount of semantic load which is shared between two sentences. Since verb is the essential part of a sentence, the main focus of the proposed model is on the verbs

ALMI: An Application Level Multicast Infrastructure

by Dimitrios Pendarakis, Dinesh Verma, Sherlia Shi, Marcel Waldvogel , 2001
"... The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems. To circumvent this situation, we have de ..."
Abstract - Cited by 335 (11 self) - Add to MetaCart
I Os of members) with many to many semantics. Session participants are connected via a vir- tual multicast tree, which consists of unicast connections between end hosts and is formed as a minimum spanning tree (MST) using application-specific performance metric. Using simulation, we show

Semantic Overlay Networks for P2P Systems

by Arturo Crespo, Hector Garcia-Molina , 2002
"... In a peer-to-peer (P2P) system, nodes typically connect to a small set of random nodes (their neighbors), and queries are propagated along these connections. Such query flooding tends to be very expensive. We propose that node connections be influenced by content, so that for example, nodes having m ..."
Abstract - Cited by 213 (0 self) - Add to MetaCart
many "Jazz" files will connect to other similar nodes. Thus, semantically related nodes form a Semantic Overlay Network (SON). Queries are routed to the appropriate SONs, increasing the chances that matching files will be found quickly, and reducing the search load on nodes that have

A Calculus of Mobile Agents

by Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, Didier Rémy, Inria Rocquencourt , 1996
"... . We introduce a calculus for mobile agents and give its chemical semantics, with a precise definition for migration, failure, and failure detection. Various examples written in our calculus illustrate how to express remote executions, dynamic loading of remote resources and protocols with mobile ag ..."
Abstract - Cited by 281 (13 self) - Add to MetaCart
. We introduce a calculus for mobile agents and give its chemical semantics, with a precise definition for migration, failure, and failure detection. Various examples written in our calculus illustrate how to express remote executions, dynamic loading of remote resources and protocols with mobile

Speculative Versioning Cache

by Sridhar Gopal, T. N. Vijaykumar James, E. Smith, Gurindar S. Sohi - In Proceedings of the Fourth International Symposium on High-Performance Computer Architecture , 1998
"... Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous memory dependences can be overcome by memory dependence speculation which enables a load or store to be speculatively exe ..."
Abstract - Cited by 207 (8 self) - Add to MetaCart
executed before the addresses of all preceding loads and stores are known. Furthermore, multiple speculative stores to a memory location create multiple speculative versions of the location. Program order among the speculative versions must be tracked to maintain sequential semantics. A previously proposed

A Distributed Object Model for the Java System

by Ann Wollrath , Roger Riggs, Jim Waldo - USENIX COMPUTING SYSTEMS , 1996
"... We show a distributed object model for the Java^TM System [1,6] (hereafter referred to simply as "Java") that retains as much of the semantics of the Java object model as possible, and only includes differences where they make sense for distributed objects. The distributed object system is ..."
Abstract - Cited by 184 (1 self) - Add to MetaCart
We show a distributed object model for the Java^TM System [1,6] (hereafter referred to simply as "Java") that retains as much of the semantics of the Java object model as possible, and only includes differences where they make sense for distributed objects. The distributed object system

Localization of syntactic comprehension by positron emission tomography

by Karin Stromswold, David Caplan, Nathaniel Alpert, Scott Rauch - Brain Lang , 1996
"... Positron Emission Tomography (PET) was used to determine regional cerebral blood flow (rCBF) when eight normal right-handed males read and made acceptabil-ity judgments about sentences. rCBF was greater in Broca’s area (particularly in the pars opercularis) when subjects judged the semantic plausibi ..."
Abstract - Cited by 178 (4 self) - Add to MetaCart
Positron Emission Tomography (PET) was used to determine regional cerebral blood flow (rCBF) when eight normal right-handed males read and made acceptabil-ity judgments about sentences. rCBF was greater in Broca’s area (particularly in the pars opercularis) when subjects judged the semantic
Results 1 - 10 of 774