Sciweavers

201 search results - page 27 / 41
» Reducing the number of clock variables of timed automata
Sort
View
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 7 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
DATE
2006
IEEE
85views Hardware» more  DATE 2006»
14 years 1 months ago
Optimizing high speed arithmetic circuits using three-term extraction
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
CVPR
2008
IEEE
14 years 9 months ago
Efficient mean shift belief propagation for vision tracking
A mechanism for efficient mean-shift belief propagation (MSBP) is introduced. The novelty of our work is to use mean-shift to perform nonparametric mode-seeking on belief surfaces...
Minwoo Park, Yanxi Liu, Robert T. Collins
ISQED
2010
IEEE
194views Hardware» more  ISQED 2010»
14 years 2 months ago
Accelerating trace computation in post-silicon debug
— Post-silicon debug comprises a significant and highly variable fraction of the total development time for large chip designs. To accelerate post-silicon debug, BackSpace [1, 2...
Johnny J. W. Kuan, Steven J. E. Wilton, Tor M. Aam...
CAGD
2000
61views more  CAGD 2000»
13 years 7 months ago
Efficient evaluation of triangular B-spline surfaces
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
Michael Franssen, Remco C. Veltkamp, Wieger Wessel...