Sciweavers

54 search results - page 9 / 11
» Computing the Pessimism of Inclusion Functions
Sort
View
ICFP
2002
ACM
14 years 7 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
13 years 12 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
SCVMA
2004
Springer
14 years 25 days ago
Comparison of Edge-Driven Algorithms for Model-Based Motion Estimation
3D-model-based tracking offers one possibility to explicate the manner in which spatial coherence can be exploited for the analysis of image sequences. Two seemingly different ap...
Hendrik Dahlkamp, Artur Ottlik, Hans-Hellmut Nagel
CVPR
2008
IEEE
14 years 9 months ago
Context and observation driven latent variable model for human pose estimation
Current approaches to pose estimation and tracking can be classified into two categories: generative and discriminative. While generative approaches can accurately determine human...
Abhinav Gupta, Trista Chen, Francine Chen, Don Kim...
FCT
2009
Springer
14 years 2 months ago
Alternating Weighted Automata
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...