• 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 19,578
Next 10 →

On the Density of Various Classes of Groups

by M. Ram Murty , 1981
"... Let B be a subset of the set of all isomorphism classes of finite groups. We consider the number Fg(x) of positive integers n < x such that all groups of order n lie in B. When ir consists of the isomorphism classes of all finite groups of any of the following types, we obtain an asymptotic formu ..."
Abstract - Add to MetaCart
Let B be a subset of the set of all isomorphism classes of finite groups. We consider the number Fg(x) of positive integers n < x such that all groups of order n lie in B. When ir consists of the isomorphism classes of all finite groups of any of the following types, we obtain an asymptotic

On the Diameter of Various Classes of H Systems

by Andrei Aun Department, Andrei P Aun
"... We investigate the complexity of various classes of H systems from the point of view of the length of their splicing rules. Specically, we consider the diameter of an H system, the quadruple of integers representing the maximal length of strings in the rules of the system. We systematically exami ..."
Abstract - Add to MetaCart
We investigate the complexity of various classes of H systems from the point of view of the length of their splicing rules. Specically, we consider the diameter of an H system, the quadruple of integers representing the maximal length of strings in the rules of the system. We systematically

On the algorithmic implementation of multi-class kernel-based vector machines

by Koby Crammer, Yoram Singer, Nello Cristianini, John Shawe-taylor, Bob Williamson - Journal of Machine Learning Research
"... In this paper we describe the algorithmic implementation of multiclass kernel-based vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic ob ..."
Abstract - Cited by 559 (13 self) - Add to MetaCart
significant running time improvements for large datasets. Finally, we describe various experiments with our approach comparing it to previously studied kernel-based methods. Our experiments indicate that for multiclass problems we attain state-of-the-art accuracy.

The Theory of Hybrid Automata

by Thomas A. Henzinger , 1996
"... A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on pur ..."
Abstract - Cited by 685 (12 self) - Add to MetaCart
on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various model-checking techniques that were originally developed for finite

Characterization of Various Classes of Protein Adducts

by Steven R. Tannenbaum, John S. Wishnok, W. G. Stillwell, Billy W. Day, Koli Taghizadeh
"... Analysis of the types of protein adducts formed by chemical carcinogens indicate that adducts may be categorized into various classes according to the nature of the carcinogen as weDl as the amino acid with which they react. Tryptophan(214) of serum albumin was previously shown to react specifically ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Analysis of the types of protein adducts formed by chemical carcinogens indicate that adducts may be categorized into various classes according to the nature of the carcinogen as weDl as the amino acid with which they react. Tryptophan(214) of serum albumin was previously shown to react

Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm

by Nick Littlestone - Machine Learning , 1988
"... learning Boolean functions, linear-threshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each ex ..."
Abstract - Cited by 773 (5 self) - Add to MetaCart
learning Boolean functions, linear-threshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each

Minimax Programs

by T. C. Hu, P. A. Tucker - University of California Press , 1997
"... We introduce an optimization problem called a minimax program that is similar to a linear program, except that the addition operator is replaced in the constraint equations by the maximum operator. We clarify the relation of this problem to some better-known problems. We identify an interesting spec ..."
Abstract - Cited by 482 (5 self) - Add to MetaCart
highly effective algorithms for solution of various classes of linear programs. Linear programming represents one of the major achievements of the operations research and mathematical programming community. Supported in part by a National Science Foundation Graduate Fellowship. In this paper we

A modular three-dimensional finite-difference ground-water flow model

by Model (michael Mcdonald, Arlen Harbaugh - U.S. Geological Survey Techniques of WaterResources Investigations Book 6, Chapter A1 , 1988
"... The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwate ..."
Abstract - Cited by 508 (5 self) - Add to MetaCart
The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation

A Survey of Image Registration Techniques

by Lisa Gottesfeld Brown - ACM Computing Surveys , 1992
"... Registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different times, from different sensors or from different viewpoints. Over the years, a broad range of techniques have been developed for the various types of data and problems. These ..."
Abstract - Cited by 979 (2 self) - Add to MetaCart
Registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different times, from different sensors or from different viewpoints. Over the years, a broad range of techniques have been developed for the various types of data and problems

Transform Analysis and Asset Pricing for Affine Jump-Diffusions

by Darrell Duffie, Jun Pan, Kenneth Singleton - Econometrica , 2000
"... In the setting of ‘‘affine’ ’ jump-diffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example applicat ..."
Abstract - Cited by 710 (38 self) - Add to MetaCart
In the setting of ‘‘affine’ ’ jump-diffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example
Next 10 →
Results 1 - 10 of 19,578
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