• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,053,038
Next 10 →

Grounding in communication

by G. A. Hunt - In , 1991
"... We give a general analysis of a class of pairs of positive self-adjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h-10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator-(d2/A2) + x2 on L2(R, dx) and let ..."
Abstract - Cited by 1082 (19 self) - Add to MetaCart
We give a general analysis of a class of pairs of positive self-adjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h-10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator-(d2/A2) + x2 on L2(R, dx) and let

Compressed sensing

by David Donoho, Yaakov Tsaig, David L. Donoho - IEEE Trans. Inf. Theory , 2006
"... We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is that a signal or image, unknown but supposed to be compressible by a known transform, (eg. wavelet or Fourier), can be subjected to fewer measurements than the nominal numbe ..."
Abstract - Cited by 3600 (24 self) - Add to MetaCart
norm. We perform a series of numerical experiments which validate in general terms the basic idea proposed in [14, 3, 5], in the favorable case where the transform coefficients are sparse in the strong sense that the vast majority are zero. We then consider a range of less-favorable cases, in which

A Sense of Self for Unix Processes

by Stephanie Forrest, Steven A. Hofmeyr, Anil Somayaji, Thomas A. Longstaff - In Proceedings of the 1996 IEEE Symposium on Security and Privacy , 1996
"... A method for anomaly detection is introduced in which "normal" is defined by short-range correlations in a process ' system calls. Initial experiments suggest that the definition is stable during normal behavior for standard UNIX programs. Further, it is able to detect several common ..."
Abstract - Cited by 684 (29 self) - Add to MetaCart
A method for anomaly detection is introduced in which "normal" is defined by short-range correlations in a process ' system calls. Initial experiments suggest that the definition is stable during normal behavior for standard UNIX programs. Further, it is able to detect several common intrusions involving sendmail and lpr. This work is part of a research program aimed at building computer security systems that incorporate the mechanisms and algorithms used by natural immune systems. 1 Introduction We are interested in developing computer security methods that are based on the way natural immune systems distinguish self from other. Such "artificial immune systems" would have richer notions of identity and protection than those afforded by current operating systems, and they could provide a layer of general-purpose protection to augment current computer security systems. An important prerequisite of such a system is an appropriate definition of self, which is the subject of this paper. W...

Automatic Word Sense Discrimination

by Hinrich Schütze - Journal of Computational Linguistics , 1998
"... This paper presents context-group discrimination, a disambiguation algorithm based on clustering. Senses are interpreted as groups (or clusters) of similar contexts of the ambiguous word. Words, contexts, and senses are represented in Word Space, a high-dimensional, real-valued space in which closen ..."
Abstract - Cited by 530 (1 self) - Add to MetaCart
This paper presents context-group discrimination, a disambiguation algorithm based on clustering. Senses are interpreted as groups (or clusters) of similar contexts of the ambiguous word. Words, contexts, and senses are represented in Word Space, a high-dimensional, real-valued space in which

Reality Mining: Sensing Complex Social Systems

by Nathan Eagle, Alex Pentland - J. OF PERSONAL AND UBIQUITOUS COMPUTING , 2005
"... We introduce a system for sensing complex social systems with data collected from one hundred mobile phones over the course of six months. We demonstrate the ability to use standard Bluetooth-enabled mobile telephones to measure information access and use in different contexts, recognize social patt ..."
Abstract - Cited by 709 (27 self) - Add to MetaCart
We introduce a system for sensing complex social systems with data collected from one hundred mobile phones over the course of six months. We demonstrate the ability to use standard Bluetooth-enabled mobile telephones to measure information access and use in different contexts, recognize social

Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004

by Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith - 34 [DRS07] [DS05] [EHMS00] [FJ01] Yevgeniy Dodis, Leonid Reyzin, and Adam , 2004
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract - Cited by 532 (38 self) - Add to MetaCart
material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed uniformly. We propose two primitives: a fuzzy extractor reliably extracts nearly uniform randomness R from its input; the extraction is error-tolerant in the sense that R will be the same even

Coupled hidden Markov models for complex action recognition

by Matthew Brand, Nuria Oliver, Alex Pentland , 1996
"... We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying two-handed actions. HMMs are perhaps the most successful framework in perceptual computing for modeling and ..."
Abstract - Cited by 497 (22 self) - Add to MetaCart
and classifying dynamic behaviors, popular because they offer dynamic time warping, a training algorithm, and a clear Bayesian semantics. However, the Markovian framework makes strong restrictive assumptions about the system generating the signal---that it is a single process having a small number of states

A Survey on Sensor Networks

by Lan F. Akyildiz, Welljan Su, Yogesh Sankarasubramaniam, Erdal Cayirci , 2002
"... Recent advancement in wireless communica- tions and electronics has enabled the develop- ment of low-cost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues that research ..."
Abstract - Cited by 1905 (1 self) - Add to MetaCart
that researchers are currently resolving. The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. This article also points out the open research issues and intends to spark new interests and developments

The lexical nature of syntactic ambiguity resolution

by Maryellen C Macdonald, Neal J Pearlmutter, Mark S Seidenberg - Psychological Review , 1994
"... Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive fr ..."
Abstract - Cited by 556 (23 self) - Add to MetaCart
Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive

Semantic Similarity in a Taxonomy: An Information-Based Measure and its Application to Problems of Ambiguity in Natural Language

by Philip Resnik , 1999
"... This article presents a measure of semantic similarityinanis-a 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 edge-counting approach. The a ..."
Abstract - Cited by 601 (9 self) - Add to MetaCart
. The article presents algorithms that take advantage of taxonomic similarity in resolving syntactic and semantic ambiguity, along with experimental results demonstrating their e#ectiveness. 1. Introduction Evaluating semantic relatedness using network representations is a problem with a long history
Next 10 →
Results 1 - 10 of 2,053,038
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University