Sciweavers

1258 search results - page 51 / 252
» Architecture-driven Problem Decomposition
Sort
View
DAC
1998
ACM
14 years 10 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...
AISC
2010
Springer
14 years 2 months ago
Symbolic Domain Decomposition
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
Jacques Carette, Alan P. Sexton, Volker Sorge, Ste...
CORR
2006
Springer
164views Education» more  CORR 2006»
13 years 9 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
IJCV
2000
133views more  IJCV 2000»
13 years 9 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
ECCV
2000
Springer
14 years 11 months ago
Estimating the Jacobian of the Singular Value Decomposition: Theory and Applications
The Singular Value Decomposition (SVD) of a matrix is a linear algebra tool that has been successfully applied to a wide variety of domains. The present paper is concerned with the...
Manolis I. A. Lourakis, Théodore Papadopoul...