• 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 98,030
Next 10 →

Graphical models, exponential families, and variational inference

by Martin J. Wainwright, Michael I. Jordan , 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract - Cited by 819 (28 self) - Add to MetaCart
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical

Tracking People with Twists and Exponential Maps

by Christoph Bregler, Jitendra Malik , 1998
"... This paper demonstrates a new visual motion estimation technique that is able to recover high degree-of-freedom articulated human body configurations in complex video sequences. We introduce the use of a novel mathematical technique, the product of exponential maps and twist motions, and its integra ..."
Abstract - Cited by 450 (5 self) - Add to MetaCart
This paper demonstrates a new visual motion estimation technique that is able to recover high degree-of-freedom articulated human body configurations in complex video sequences. We introduce the use of a novel mathematical technique, the product of exponential maps and twist motions, and its

Articulated body motion capture by annealed particle filtering

by Jonathan Deutscher, Andrew Blake, Ian Reid - In IEEE Conf. on Computer Vision and Pattern Recognition , 2000
"... The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach is to intr ..."
Abstract - Cited by 494 (4 self) - Add to MetaCart
The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach

Parameterized Complexity

by Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen , 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract - Cited by 1213 (77 self) - Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs

Monotone Complexity

by Michelangelo Grigni , Michael Sipser , 1990
"... We give a general complexity classification scheme for monotone computation, including monotone space-bounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract - Cited by 2825 (11 self) - Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone space-bounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a

Nineteen Dubious Ways to Compute the Exponential of at Matrix

by Cleve Moler , Charles Van Loan - SIAM REVIEW , 1978
"... ..."
Abstract - Cited by 447 (0 self) - Add to MetaCart
Abstract not found

Computer Vision

by Kusuma Kumari B. M , 1982
"... Driver inattention is one of the main causes of traffic accidents. Monitoring a driver to detect inattention is a complex problem that involves physiological and behavioral elements. Different approaches have been made, and among them Computer Vision has the potential of monitoring the person behind ..."
Abstract - Cited by 1041 (11 self) - Add to MetaCart
Driver inattention is one of the main causes of traffic accidents. Monitoring a driver to detect inattention is a complex problem that involves physiological and behavioral elements. Different approaches have been made, and among them Computer Vision has the potential of monitoring the person

Statistical mechanics of complex networks

by Réka Albert, Albert-lászló Barabási - Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract - Cited by 2148 (11 self) - Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled

Quantum complexity theory

by Ethan Bernstein, Umesh Vazirani - in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM , 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract - Cited by 574 (5 self) - Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97

Linguistic Complexity: Locality of Syntactic Dependencies

by Edward Gibson - COGNITION , 1998
"... This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory -- the Syntactic Prediction Locality Theory (SPLT) -- has two components: an integration cost component and a component for the memory cost associa ..."
Abstract - Cited by 504 (31 self) - Add to MetaCart
This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory -- the Syntactic Prediction Locality Theory (SPLT) -- has two components: an integration cost component and a component for the memory cost
Next 10 →
Results 1 - 10 of 98,030
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