• 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 23,032
Next 10 →

Depth first search and linear graph algorithms

by Robert Tarjan - SIAM JOURNAL ON COMPUTING , 1972
"... The value of depth-first search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract - Cited by 1406 (19 self) - Add to MetaCart
The value of depth-first search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components

Knowledge Interchange Format Version 3.0 Reference Manual

by Michael Genesereth, Richard E. Fikes, Ronald Brachman, Thomas Gruber, Patrick Hayes, Reed Letsinger, Vladimir Lifschitz, Robert Macgregor, John Mccarthy, Peter Norvig, Ramesh Patil , 1992
"... : Knowledge Interchange Format (KIF) is a computer-oriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); ..."
Abstract - Cited by 484 (14 self) - Add to MetaCart
); it is logically comprehensive (i.e. it provides for the expression of arbitrary sentences in the first-order predicate calculus); it provides for the representation of knowledge about the representation of knowledge; it provides for the representation of nonmonotonic reasoning rules; and it provides

A First Version of the Caenorhabditis

by Elegans Promoterome
"... An important aspect of the development of systems biology approaches in metazoans is the characterization of expression patterns of nearly all genes predicted from genome sequences. Such “localizome ” maps should provide information on where (in what cells or tissues) and when (at what stage of deve ..."
Abstract - Add to MetaCart
protein (GFP). To ensure high flexibility for future uses, we utilized the newly developed MultiSite Gateway system. We generated and validated “version 1.1 ” of the Promoterome: a resource of ∼6000 C. elegans promoters. These promoters can be transferred easily into various Gateway Destination vectors

First version: Nov-2002

by Yoram L, Alon Raviv, Jel Classification G , 2003
"... seminar participants at the, SGF annual meeting in Zurich, Eastern Finance Association Meeting held in ..."
Abstract - Add to MetaCart
seminar participants at the, SGF annual meeting in Zurich, Eastern Finance Association Meeting held in

Statistical Analysis of Cointegrated Vectors

by Soren Johansen - Journal of Economic Dynamics and Control , 1988
"... We consider a nonstationary vector autoregressive process which is integrated of order 1, and generated by i.i.d. Gaussian errors. We then derive the maximum likelihood estimator of the space of cointegration vectors and the likelihood ratio test of the hypothesis that it has a given number of dimen ..."
Abstract - Cited by 2749 (12 self) - Add to MetaCart
of dimensions. Further we test linear hypotheses about the cointegration vectors. The asymptotic distribution of these test statistics are found and the first is described by a natural multivariate version of the usual test for unit root in an autoregressive process, and the other is a x2 test. 1.

Multivariable Feedback Control: Analysis

by Sigurd Skogestad, Ian Postlethwaite - span (B∗) und Basis B∗ = { ω1 , 2005
"... multi-input, multi-output feed-back control design for linear systems using the paradigms, theory, and tools of robust con-trol that have arisen during the past two decades. The book is aimed at graduate students and practicing engineers who have a basic knowledge of classical con-trol design and st ..."
Abstract - Cited by 564 (24 self) - Add to MetaCart
and state-space con-trol theory for linear systems. A basic knowledge of matrix theory and linear algebra is required to appreciate and digest the material offered. This edition is a revised and expanded version of the first edition, which was published in 1996. The size of the

A review of image denoising algorithms, with a new one

by A. Buades, B. Coll, J. M. Morel - SIMUL , 2005
"... The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication of the recently proposed methods, most algorithms have not yet attained a desirable level of applicability. All show an outstanding perf ..."
Abstract - Cited by 508 (6 self) - Add to MetaCart
performance when the image model corresponds to the algorithm assumptions but fail in general and create artifacts or remove image fine structures. The main focus of this paper is, first, to define a general mathematical and experimental methodology to compare and classify classical image denoising algorithms

Raptor codes

by Amin Shokrollahi - IEEE Transactions on Information Theory , 2006
"... LT-Codes are a new class of codes introduced in [1] for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LT-Codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract - Cited by 577 (7 self) - Add to MetaCart
, and the original symbols are recovered from the collected ones with O(k log(1/ε)) operations. We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions

Learning Stochastic Logic Programs

by Stephen Muggleton , 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic context-free grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first-order r ..."
Abstract - Cited by 1194 (81 self) - Add to MetaCart
Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic context-free grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first

The WEKA Data Mining Software: An Update

by Mark Hall, Eibe Frank, Geoffrey Holmes, Bernhard Pfahringer, Peter Reutemann, Ian H. Witten
"... More than twelve years have elapsed since the first public release of WEKA. In that time, the software has been rewritten entirely from scratch, evolved substantially and now accompanies a text on data mining [35]. These days, WEKA enjoys widespread acceptance in both academia and business, has an a ..."
Abstract - Cited by 1756 (15 self) - Add to MetaCart
More than twelve years have elapsed since the first public release of WEKA. In that time, the software has been rewritten entirely from scratch, evolved substantially and now accompanies a text on data mining [35]. These days, WEKA enjoys widespread acceptance in both academia and business, has
Next 10 →
Results 1 - 10 of 23,032
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