• 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 483,582
Next 10 →

THE GALERKIN FINITE ELEMENT METHOD FOR A MULTI-TERM TIME-FRACTIONAL DIFFUSION EQUATION

by Bangti Jin, Raytcho Lazarov, Yikan Liu, Zhi Zhou
"... Abstract. We consider the initial/boundary value problem for a diffusion equa-tion involving multiple time-fractional derivatives on a bounded convex polyhedral domain. We analyze a space semidiscrete scheme based on the standard Galerkin finite element method using continuous piecewise linear funct ..."
Abstract - Add to MetaCart
Abstract. We consider the initial/boundary value problem for a diffusion equa-tion involving multiple time-fractional derivatives on a bounded convex polyhedral domain. We analyze a space semidiscrete scheme based on the standard Galerkin finite element method using continuous piecewise linear

Domain Theory

by Samson Abramsky, Achim Jung - Handbook of Logic in Computer Science , 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract - Cited by 546 (25 self) - Add to MetaCart
Least fixpoints as meanings of recursive definitions.

time-space

by Pierre Ladevèze B, Jean-charles Passieux
"... multiscale computational mechanics with ..."
Abstract - Add to MetaCart
multiscale computational mechanics with

The Elements of Statistical Learning -- Data Mining, Inference, and Prediction

by Trevor Hastie, Robert Tibshirani, Jerome Friedman
"... ..."
Abstract - Cited by 1320 (13 self) - Add to MetaCart
Abstract not found

Large margin methods for structured and interdependent output variables

by Ioannis Tsochantaridis, Thorsten Joachims, Thomas Hofmann, Yasemin Altun - JOURNAL OF MACHINE LEARNING RESEARCH , 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract - Cited by 612 (12 self) - Add to MetaCart
that solves the optimization problem in polynomial time for a large class of problems. The proposed method has important applications in areas such as computational biology, natural language processing, information retrieval/extraction, and optical character recognition. Experiments from various domains

Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow

by Mathieu Desbrun , Mark Meyer, Peter Schröder, Alan H. Barr , 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high-fidelit ..."
Abstract - Cited by 553 (24 self) - Add to MetaCart
-fidelity computer graphics objects using imperfectly-measured data from the real world. Our approach contains three novel features: an implicit integration method to achieve efficiency, stability, and large time-steps; a scale-dependent Laplacian operator to improve the diffusion process; and finally, a robust

Chebyshev and Fourier Spectral Methods

by John P. Boyd , 1999
"... ..."
Abstract - Cited by 778 (12 self) - Add to MetaCart
Abstract not found

Numerical Solutions of the Euler Equations by Finite Volume Methods Using Runge-Kutta Time-Stepping Schemes

by Antony Jameson, Wolfgang Schmidt, Eli Turkel , 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract - Cited by 456 (78 self) - Add to MetaCart
A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used

Understanding Normal and Impaired Word Reading: Computational Principles in Quasi-Regular Domains

by David C. Plaut , James L. McClelland, Mark S. Seidenberg, Karalyn Patterson - PSYCHOLOGICAL REVIEW , 1996
"... We develop a connectionist approach to processing in quasi-regular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract - Cited by 583 (94 self) - Add to MetaCart
We develop a connectionist approach to processing in quasi-regular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 574 (50 self) - Add to MetaCart
We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given
Next 10 →
Results 1 - 10 of 483,582
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