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

CiteSeerX logo

Tools

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

Singular Combinatorics

by Philippe Flajolet - ICM 2002 VOL. III 1-3 , 2002
"... Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures. " ..."
Abstract - Cited by 800 (10 self) - Add to MetaCart
. "Singularity analysis" reviewed here provides constructive estimates that are applicable in several areas of combinatorics. It constitutes a complex-analytic Tauberian procedure by which combinatorial constructions and asymptotic-probabilistic laws can be systematically related.

The DLV System for Knowledge Representation and Reasoning

by Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello - ACM Transactions on Computational Logic , 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract - Cited by 456 (102 self) - Add to MetaCart
programming methodology which allows one to encode complex problems (up to ∆P 3-complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of

Distributed representations, simple recurrent networks, and grammatical structure

by Jeffrey L. Elman - Machine Learning , 1991
"... Abstract. In this paper three problems for a connectionist account of language are considered: 1. What is the nature of linguistic representations? 2. How can complex structural relationships such as constituent structure be represented? 3. How can the apparently open-ended nature of language be acc ..."
Abstract - Cited by 401 (17 self) - Add to MetaCart
complex distributed representations which encode the relevant grammatical relations and hierarchical constituent structure. Differences between the SRN state representations and the more traditional pushdown store are discussed in the final section.

Simulation, verification, automated composition of web services

by Srini Narayanan, Sheila A. Mcilraith - In WWW , 2002
"... Web services-- Web-accessible programs and devices – are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semantic Web comes the opportunity to automate various Web services tasks. Our objective is to enable markup and automated reason ..."
Abstract - Cited by 391 (7 self) - Add to MetaCart
. With the semantics in hand, we encode our service descriptions in a Petri Net formalism and provide decision procedures for Web service simulation, verification and composition. We also provide an analysis of the complexity of these tasks under different restrictions to the DAML-S composite services we can describe

Characterization of microbial diversity by determining terminal restriction length polymorphisms of genes encoding 16S rDNA.

by Wen-Tso Liu , Terence L Marsh , Hans Cheng , Larry J Forney - Appl. Environ. Microbiol. , 1997
"... A quantitative molecular technique was developed for rapid analysis of microbial community diversity in various environments. The technique employed PCR in which one of the two primers used was fluorescently labeled at the 5 end and was used to amplify a selected region of bacterial genes encoding ..."
Abstract - Cited by 263 (7 self) - Add to MetaCart
A quantitative molecular technique was developed for rapid analysis of microbial community diversity in various environments. The technique employed PCR in which one of the two primers used was fluorescently labeled at the 5 end and was used to amplify a selected region of bacterial genes encoding

Direct analysis of genes encoding 16S rRNA from complex communities reveals many novel molecular species within the human

by Antonia Suau, Régis Bonnet, Malène Sutren, Glenn R. Gibson, Matthew D. Collins, Joel Doré, Antonia Suau, Régis Bonnet, Malène Sutren, Jean-jacques Godon, Glenn R. Gibson, Matthew D. Collins, Joel Doré , 1999
"... Updated information and services can be found at: ..."
Abstract - Cited by 190 (12 self) - Add to MetaCart
Updated information and services can be found at:

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - Proceedings of the ISMRM 6th Annual Meeting, , 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract - Cited by 193 (3 self) - Add to MetaCart
or collimation but by spectral analysis. The idea of Lauterbur (1) to encode object contrast in the resonance spectrum by a magnetic field gradient forms the exclusive basis of signal localization in Fourier imaging. However powerful, the gradient-encoding concept implies a fundamental restriction. Only one

An Analysis of Single-Layer Networks in Unsupervised Feature Learning

by Adam Coates, Honglak Lee, Andrew Y. Ng
"... A great deal of research has focused on algorithms for learning features from unlabeled data. Indeed, much progress has been made on benchmark datasets like NORB and CIFAR by employing increasingly complex unsupervised learning algorithms and deep models. In this paper, however, we show that several ..."
Abstract - Cited by 223 (19 self) - Add to MetaCart
A great deal of research has focused on algorithms for learning features from unlabeled data. Indeed, much progress has been made on benchmark datasets like NORB and CIFAR by employing increasingly complex unsupervised learning algorithms and deep models. In this paper, however, we show

The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models

by David V. Pynadath, Milind Tambe - JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH , 2002
"... Despite the significant progress in multiagent teamwork, existing research does not address the optimality of its prescriptions nor the complexity of the teamwork problem. Without a characterization of the optimality-complexity tradeoffs, it is impossible to determine whether the assumptions and app ..."
Abstract - Cited by 233 (21 self) - Add to MetaCart
Despite the significant progress in multiagent teamwork, existing research does not address the optimality of its prescriptions nor the complexity of the teamwork problem. Without a characterization of the optimality-complexity tradeoffs, it is impossible to determine whether the assumptions

High-performance complex event processing over streams

by Eugene Wu - In SIGMOD , 2006
"... In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. These complex event queries filter and correlate events to match specific patterns, and transform the relevant events into n ..."
Abstract - Cited by 161 (7 self) - Add to MetaCart
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. These complex event queries filter and correlate events to match specific patterns, and transform the relevant events
Next 10 →
Results 1 - 10 of 2,501
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