Results 11  20
of
5,309
Realtime human pose recognition in parts from single depth images
 IN CVPR
, 2011
"... We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler p ..."
Abstract

Cited by 568 (17 self)
 Add to MetaCart
We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler
Greed is Good: Algorithmic Results for Sparse Approximation
, 2004
"... This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal representa ..."
Abstract

Cited by 916 (9 self)
 Add to MetaCart
representation of an exactly sparse signal. It leverages this theory to show that both OMP and BP succeed for every sparse input signal from a wide class of dictionaries. These quasiincoherent dictionaries offer a natural generalization of incoherent dictionaries, and the cumulative coherence function
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
, 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract

Cited by 457 (3 self)
 Add to MetaCart
this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science
EXACT REPRESENTATIONS FOR TUMOUR INCIDENCE FOR SOME DENSITYDEPENDENT MODELS
, 2005
"... Carcinogenesis is a multistage random process involving generic changes and stochastic proliferation and differentiation of normal cells and genetically altered stem cells. In this paper, we present the probability of time to tumour onset for a carcinogenesis model wherein the cells grow according t ..."
Abstract
 Add to MetaCart
Carcinogenesis is a multistage random process involving generic changes and stochastic proliferation and differentiation of normal cells and genetically altered stem cells. In this paper, we present the probability of time to tumour onset for a carcinogenesis model wherein the cells grow according to a birth and death process with densitydependent birth and death rates. This is achieved by transforming the underlying system of difference equations which results in a continued fraction. This continued fraction approach helps us to find the complete solutions. The popular MoolgavkarVenzonKnudson (MVK) model assumes constant birth, death, and transition rates. 1.
AN EXACT REPRESENTATION OF EFFECTIVE CUTTING SHAPES OF 5AXIS CNC MACHINING USING RATIONAL BÉZIER AND BSPLINE TOOL MOTIONS
"... Presented in this paper is a new approach to 5axis CNC tool path generation for sculptured surface machining with a flatend cutter. Rational Bézier and Bspline motions are used to plan cutter motions so that an exact representation of the effective cutting shape can be obtained. The exact repres ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Presented in this paper is a new approach to 5axis CNC tool path generation for sculptured surface machining with a flatend cutter. Rational Bézier and Bspline motions are used to plan cutter motions so that an exact representation of the effective cutting shape can be obtained. The exact
A novel exact representation of stationary colored gaussian processes (fractional differential approach
 Journal of Physics A: Mathematical and Theoretical
"... A novel representation of functions, called generalized Taylor form, is applied to the filtering of white noise processes. It is shown that every Gaussian colored noise can be expressed as the output of a set of linear fractional stochastic differential equation whose solution is a weighted sum of ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A novel representation of functions, called generalized Taylor form, is applied to the filtering of white noise processes. It is shown that every Gaussian colored noise can be expressed as the output of a set of linear fractional stochastic differential equation whose solution is a weighted sum
Creative Commons Attribution License. A Finite Exact Representation of Register Automata Configurations
"... A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many configurations. We describe a technique to classify infinite register automata configurations into finitely many exact ..."
Abstract
 Add to MetaCart
exact representative configurations. Using the finitary representation, we give an algorithm solving the reachability problem for register automata. We moreover define a computation tree logic for register automata and solve its model checking problem. 1
An exact representation of the fermion dynamics in terms of Poisson . . . processes and its connection with Monte Carlo Algorithms
, 1999
"... ..."
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
 In proceedings of ACM SIGMOD Conference on Management of Data
, 2002
"... Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data.. The most promising solutions' involve performing dimensionality reduction on the data, then indexing the reduced d ..."
Abstract

Cited by 316 (33 self)
 Add to MetaCart
which we call Adaptive Piecewise Constant Approximation (APCA). While previous techniques (e.g., SVD, DFT and DWT) choose a common representation for all the items in the database that minimizes the global reconstruction error, APCA approximates each time series by a set of constant value segments
Results 11  20
of
5,309