Results 1  10
of
34,083
ChernSimons Gauge Theory as a String Theory
, 2003
"... Certain two dimensional topological field theories can be interpreted as string theory backgrounds in which the usual decoupling of ghosts and matter does not hold. Like ordinary string models, these can sometimes be given spacetime interpretations. For instance, threedimensional ChernSimons gaug ..."
Abstract

Cited by 545 (13 self)
 Add to MetaCart
Simons gauge theory can arise as a string theory. The worldsheet model in this case involves a topological sigma model. Instanton contributions to the sigma model give rise to Wilson line insertions in the spacetime ChernSimons theory. A certain holomorphic analog of ChernSimons theory can also arise as a
Localitysensitive hashing scheme based on pstable distributions
 In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry
, 2004
"... inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate ..."
Abstract

Cited by 521 (8 self)
 Add to MetaCart
NN algorithm for the caseÔ�. We also show that the algorithm finds the exact near neigbhor time for data satisfying certain “bounded growth ” condition. Unlike earlier schemes, our LSH scheme works directly on points in the Euclidean space without embeddings. Consequently, the resulting query time
Games with Incomplete Information Played by 'Bayesian' Players, IIII
 MANAGEMENT SCIENCE
, 1967
"... The paper develops a new theory for the analysis of games with incomplete information where the players are uncertain about some important parameters of the game situation, such as the payoff functions, the strategies available to various players, the information other players have about the game, e ..."
Abstract

Cited by 787 (2 self)
 Add to MetaCart
probability distributions derived from a certain "basic probability distribution " over the parameters unknown to the various players But later the theory is extended also to cases where the different players' subjective probability distributions fail to satisfy this consistency assumption
Semantic Similarity in a Taxonomy: An InformationBased Measure and its Application to Problems of Ambiguity in Natural Language
, 1999
"... This article presents a measure of semantic similarityinanisa taxonomy based on the notion of shared information content. Experimental evaluation against a benchmark set of human similarity judgments demonstrates that the measure performs better than the traditional edgecounting approach. The a ..."
Abstract

Cited by 609 (9 self)
 Add to MetaCart
in arti#cial intelligence and psychology, dating back to the spreading activation approach of Quillian #1968# and Collins and Loftus #1975#. Semantic similarity represents a special case of semantic relatedness: for example, cars and gasoline would seem to be more closely related than, say, cars
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 727 (18 self)
 Add to MetaCart
boosting algorithm for combining preferences called RankBoost. We also describe an efficient implementation of the algorithm for certain natural cases. We discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different WWW
Learning and development in neural networks: The importance of starting small
 Cognition
, 1993
"... It is a striking fact that in humans the greatest learnmg occurs precisely at that point in time childhood when the most dramatic maturational changes also occur. This report describes possible synergistic interactions between maturational change and the ability to learn a complex domain (language ..."
Abstract

Cited by 531 (17 self)
 Add to MetaCart
(language), as investigated in connectionist networks. The networks are trained to process complex sentences involving relative clauses, number agreement, and several types of verb argument structure. Training fails in the case of networks which are fully formed and ‘adultlike ’ in their capacity. Training
Achieving 100% Throughput in an InputQueued Switch
 IEEE TRANSACTIONS ON COMMUNICATIONS
, 1996
"... It is well known that headofline (HOL) blocking limits the throughput of an inputqueued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if nonFIFO queueing policies are used, the throughput can be increas ..."
Abstract

Cited by 527 (27 self)
 Add to MetaCart
It is well known that headofline (HOL) blocking limits the throughput of an inputqueued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if nonFIFO queueing policies are used, the throughput can
Cooperative strategies and capacity theorems for relay networks
 IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant of ..."
Abstract

Cited by 739 (19 self)
 Add to MetaCart
with the rate of a distributed antenna array with full cooperation even though the transmitting antennas are not colocated. The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, singlebounce fading, certain quasistatic fading problems, cases where partial
On limits of wireless communications in a fading environment when using multiple antennas
 Wireless Personal Communications
, 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bitrates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multielement array (M ..."
Abstract

Cited by 2426 (14 self)
 Add to MetaCart
(MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless
Collaborative plans for complex group action
, 1996
"... The original formulation of SharedPlans by B. Grosz and C. Sidner ( 1990) was developed to provide a model of collaborative planning in which it was not necessary for one agent to have intentionsto toward an act of a different agent. Unlike other contemporaneous approaches (J.R. Searle, 1990), this ..."
Abstract

Cited by 543 (30 self)
 Add to MetaCart
not adequately deal with agents having only partial knowledge of the way in which to perform an action. This paper provides a revised and expanded version of SharedPlans that addresses these shortcomings. It also reformulates Pollack’s ( 1990) definition of individual plans to handle cases in which a single
Results 1  10
of
34,083