Sciweavers

1795 search results - page 308 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
FIW
2009
101views Communications» more  FIW 2009»
13 years 7 months ago
Feature Interaction Detection in the Feature Language Extensions
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
Lei Sun, Lu Zhoa, Yimeng Li, Wu-Hon F. Leung
BMVC
2010
13 years 5 months ago
Multi-View Planning for Simultaneous Coverage and Accuracy Optimisation
View planning for three-dimensional (3D) reconstruction and inspection solves the problem of finding an efficient sequence of views allowing complete and high quality reconstructi...
Christoph Munkelt, Andreas Breitbarth, Gunther Not...
SIAMNUM
2011
124views more  SIAMNUM 2011»
13 years 4 months ago
Discrete Compactness for the p-Version of Discrete Differential Forms
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
Daniele Boffi, Martin Costabel, Monique Dauge, Les...
EM
2010
154views Management» more  EM 2010»
13 years 4 months ago
Higher-Weight Heegner Points
In this paper we formulate a conjecture which partially generalizes the Gross-Kohnen-Zagier theorem to higher weight modular forms. For f S2k(N) satisfying certain conditions, we c...
Kimberly Hopkins
TCAD
2010
102views more  TCAD 2010»
13 years 4 months ago
Functional Test Generation Using Efficient Property Clustering and Learning Techniques
Abstract--Functional verification is one of the major bottlenecks in system-on-chip design due to the combined effects of increasing complexity and lack of automated techniques for...
Mingsong Chen, Prabhat Mishra