Results 1  10
of
1,365
MODEC: Multimodal Decomposable Models for Human Pose Estimation
"... We propose a multimodal, decomposable model for articulated human pose estimation in monocular images. A typical approach to this problem is to use a linear structured model, which struggles to capture the wide range of appearance present in realistic, unconstrained images. In this paper, we instead ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
which controls the tradeoff between speed and accuracy, yielding a 5x speedup in inference and learning. Our model outperforms stateoftheart approaches across the accuracyspeed tradeoff curve for several pose datasets. This includes our newlycollected dataset of people in movies, FLIC, which
POSTER PRESENTATION Open Access Neural dynamics of the speedaccuracy tradeoff
"... In decision making experiments, faster decisions are accomplished at the expense of accuracy. Conversely, more accurate decisions are accomplished at the expense of time (see [1]). These data describe the speedaccuracy tradeoff (SAT) and can be explained by the principles of bounded integration, w ..."
Abstract
 Add to MetaCart
In decision making experiments, faster decisions are accomplished at the expense of accuracy. Conversely, more accurate decisions are accomplished at the expense of time (see [1]). These data describe the speedaccuracy tradeoff (SAT) and can be explained by the principles of bounded integration
Probing the Pareto frontier for basis pursuit solutions
, 2008
"... The basis pursuit problem seeks a minimum onenorm solution of an underdetermined leastsquares problem. Basis pursuit denoise (BPDN) fits the leastsquares problem only approximately, and a single parameter determines a curve that traces the optimal tradeoff between the leastsquares fit and the ..."
Abstract

Cited by 365 (5 self)
 Add to MetaCart
The basis pursuit problem seeks a minimum onenorm solution of an underdetermined leastsquares problem. Basis pursuit denoise (BPDN) fits the leastsquares problem only approximately, and a single parameter determines a curve that traces the optimal tradeoff between the leastsquares fit
Partial parsing via finitestate cascades
 Natural Language Engineering
, 1996
"... Finitestate cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finitestate cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers d ..."
Abstract

Cited by 340 (4 self)
 Add to MetaCart
do not necessarily involve trading off accuracy against speed—they may in fact be more accurate than exhaustivesearch stochastic contextfree parsers. 1 FiniteState Cascades Of current interest in corpusoriented computational linguistics are techniques for bootstrapping broadcoverage parsers from
An informatic rationale for the speedaccuracy tradeoff
 Proc. IEEE SMC
, 2009
"... Abstract—This paper argues that the speedaccuracy tradeoff arises as a consequence of Shannon’s Fundamental Theorem for a Channel with Noise, when coupled with two additional postulates: that people are imperfect information processors, and that motivation is a necessary condition of the speedacc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—This paper argues that the speedaccuracy tradeoff arises as a consequence of Shannon’s Fundamental Theorem for a Channel with Noise, when coupled with two additional postulates: that people are imperfect information processors, and that motivation is a necessary condition of the speedaccuracy
The radiance lighting simulation and rendering system
 In Proceedings of SIGGRAPH 94, ACM SIGGRAPH / ACM
, 1994
"... This paper describes a physicallybased rendering system tailored to the demands of lighting design and architecture. The simulation uses a lightbackwards raytracing method with extensions to efficiently solve the rendering equation under most conditions. This includes specular, diffuse and direct ..."
Abstract

Cited by 298 (8 self)
 Add to MetaCart
and directionaldiffuse reflection and transmission in any combination to any level in any environment, including complicated, curved geometries. The simulation blends deterministic and stochastic raytracing techniques to achieve the best balance between speed and accuracy in its local and global illumination methods
On the approximability of tradeoffs and optimal access of web sources (Extended Abstract)
 Proceedings 41st Annual Symposium on Foundations of Computer Science
, 2000
"... We study problems in multiobjective optimization, in which solutions to a combinatorial optimization problem are evaluated with respect to several cost criteria, and we are interested in the tradeoff between these objectives (the socalled Pareto curve). We point out that, under very general condit ..."
Abstract

Cited by 142 (3 self)
 Add to MetaCart
We study problems in multiobjective optimization, in which solutions to a combinatorial optimization problem are evaluated with respect to several cost criteria, and we are interested in the tradeoff between these objectives (the socalled Pareto curve). We point out that, under very general
Speed versus Accuracy TradeOffs in Microarchitectural Simulations
"... Abstract—Due to the long simulation time of the reference input set, computer architects often use reduced time simulation techniques to shorten the simulation time. However, what has not yet been thoroughly evaluated is the accuracy of these techniques relative to the reference input set and with r ..."
Abstract
 Add to MetaCart
and with respect to each other. To rectify this deficiency, this paper uses three methods to characterize reduced input set, truncated execution, and samplingbased simulation techniques while also examining their speed versus accuracy tradeoff and configuration dependence. Our results show that the three
SpeedAccuracy Tradeoff in Gate Sizing
"... Gate sizing is used to scale the drive capability of CMOSgates in order to improve the timing or to reduce the power dissipation of a logic circuit. Gate sizing can be formulated as a nonlinear optimization problem. This nonlinear optimization problem in turn can be linearized. The resulting linear ..."
Abstract
 Add to MetaCart
linear programming formulation can be solved by an interior point method. Solving this linear program takes considerable time and the accuracy typically required for gate sizing is not too demanding. A possibility for a speedaccuracy tradeoff exists. We propose to use the primaldual gap of an interior
SpeedAccuracy Tradeoff in Gate Sizing
"... Gate sizing is used to scale the drive capability of CMOSgates in order to improve the timing or to reduce the power dissipation of a logic circuit. Gate sizing can be formulated as a nonlinear optimization problem. This nonlinear optimization problem in turn can be linearized. The resulting linear ..."
Abstract
 Add to MetaCart
linear programming formulation can be solved by an interior point method. Solving this linear program takes considerable time and the accuracy typically required for gate sizing is not too demanding. A possibility for a speedaccuracy tradeoff exists. We propose to use the primaldual gap of an interior
Results 1  10
of
1,365