Sciweavers

1670 search results - page 71 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
147
Voted
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 7 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
184
Voted
CCA
2009
Springer
15 years 7 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
110
Voted
DEBS
2007
ACM
15 years 4 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
112
Voted
3DPVT
2006
IEEE
189views Visualization» more  3DPVT 2006»
15 years 8 months ago
Fast Safe Spline Surrogates for Large Point Clouds
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
Ashish Myles, Jörg Peters
112
Voted
ICPR
2000
IEEE
16 years 3 months ago
Constructing Finite State Machines for Fast Gesture Recognition
This paper proposes an approach to 2D gesture recognition that models each gesture as a Finite State Machine (FSM) in spatial-temporal space. The model construction works in a sem...
Pengyu Hong, Thomas S. Huang, Matthew Turk