Results 1  10
of
1,303
Exploiting Generative Models in Discriminative Classifiers
 In Advances in Neural Information Processing Systems 11
, 1998
"... Generative probability models such as hidden Markov models provide a principled way of treating missing information and dealing with variable length sequences. On the other hand, discriminative methods such as support vector machines enable us to construct flexible decision boundaries and often resu ..."
Abstract

Cited by 551 (9 self)
 Add to MetaCart
result in classification performance superior to that of the model based approaches. An ideal classifier should combine these two complementary approaches. In this paper, we develop a natural way of achieving this combination by deriving kernel functions for use in discriminative methods such as support
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 541 (48 self)
 Add to MetaCart
increase slowly as a function of the number of nodes (like O(log n) orO(log(log n)). Existing graph generation models do not exhibit these types of behavior, even at a qualitative level. We provide a new graph generator, based on a “forest fire” spreading process, that has a simple, intuitive justification
NounPhrase Anaphora and Focus: The Informational Load Hypothesis
, 1999
"... The processing of NP anaphors in discourse is argued to be grounded in cognitive representation and communicative principles. Derived from the Griceian maxim of quantity, the proposed theory views NP anaphor processing as an optimization process based on the principle that processing cost, defined i ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
the conceptual relation between the anaphors and their antecedents. The results show that reading times of NP anaphors reflect their functional justification  anaphors were read faster when their cost had a better functional justification. These results are incompatible with any theory that treats NP anaphors
Justification
, 1993
"... The purpose of this thesis wan to develop a set of control laws, impleme~nted in a simulation, to allow the Cruise Missile Control Aircraft (CXMCA) to radar track cruise missiles and achieve 100 % radar coverage during test flights. The CXNCA was forced to perform a series of intercepts on set point ..."
Abstract
 Add to MetaCart
points recomputed every ton seconds. Fuszy logic formed a vital function in determining wbore the set point would be, and used current and future missile posit4 on data. j This thosis development and completion was only possible through the tireless help and motivation provi4e by my advisor, Col Don
Graph evolution: Densification and shrinking diameters
 ACM TKDD
, 2007
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 267 (16 self)
 Add to MetaCart
increase slowly as a function of the number of nodes (like O(log n) or O(log(log n)). Existing graph generation models do not exhibit these types of behavior, even at a qualitative level. We provide a new graph generator, based on a “forest fire” spreading process, that has a simple, intuitive
The Security of the Cipher Block Chaining Message Authentication Code
, 2000
"... Let F be some block cipher (eg., DES) with block length l. The Cipher Block Chaining Message Authentication Code (CBC MAC) specifies that an mblock message x: Xl...xm be authenticated among parties who share a secret key a for the block cipher by tagging x with a prefix of ym, where Y0: 01 and Y ..."
Abstract

Cited by 240 (41 self)
 Add to MetaCart
and Yi: Fa(miYi1) for i: 1,2,...,m. This method is a pervasively used international and U.S. standard. We provide its first formal justification, showing the following general lemma: cipher block chaining a pseudorandom function yields a pseudorandom function. Underlying our results is a technical
ANAPHORIC BINDING in
"... Recent work by Ron Kaplan within the framework of LexicalFunctional Grammar recasts longdistance dependencies (such as relativization or topicalization) in terms of permissable paths within functional structures. This paper proposes a slight addition to the new formalism which enables LexicalFunc ..."
Abstract
 Add to MetaCart
Recent work by Ron Kaplan within the framework of LexicalFunctional Grammar recasts longdistance dependencies (such as relativization or topicalization) in terms of permissable paths within functional structures. This paper proposes a slight addition to the new formalism which enables LexicalFunctional
Constraints on anaphoric functions
, 2012
"... Some constraints on functions from sets and relations to sets are studied. Such constraints are satisfied by anaphoric functions, that is functions denoted by anaphoric determiners. These constraints are generalisations of anaphor conditions known from the study of simpler cases of nominal anaphors. ..."
Abstract
 Add to MetaCart
Some constraints on functions from sets and relations to sets are studied. Such constraints are satisfied by anaphoric functions, that is functions denoted by anaphoric determiners. These constraints are generalisations of anaphor conditions known from the study of simpler cases of nominal anaphors
SemiSupervised Learning on Riemannian Manifolds
, 2004
"... We consider the general problem of utilizing both labeled and unlabeled data to improve classification accuracy. Under the assumption that the data lie on a submanifold in a high dimensional space, we develop an algorithmic framework to classify a partially labeled data set in a principled manner. ..."
Abstract

Cited by 193 (7 self)
 Add to MetaCart
. The central idea of our approach is that classification functions are naturally defined only on the submanifold in question rather than the total ambient space. Using the LaplaceBeltrami operator one produces a basis (the Laplacian Eigenmaps) for a Hilbert space of square integrable functions
Anaphoric Binding in Modern Greek
, 1998
"... this paper we present data which casts some doubts on a purely configurational account of anaphoric binding. We show how the properties of MG anaphors can be straightforwardly accounted for by formulating constraints directly associated with the lexical properties of the anaphors themselves (Dalrymp ..."
Abstract
 Add to MetaCart
(Dalrymple (1993)). Furthermore, we show how the relation between anaphors and their antecedents can be accounted for by making reference to a ranking of grammatical functions and thematic roles. 2 Anaphors in Modern Greek
Results 1  10
of
1,303