Sciweavers

1955 search results - page 41 / 391
» Can Computers Handle Adverbs
Sort
View
FMCAD
2000
Springer
15 years 7 months ago
SAT-Based Image Computation with Application in Reachability Analysis
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Anubhav G...
108
Voted
WWW
2008
ACM
16 years 4 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
165
Voted
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 7 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
SBBD
2004
119views Database» more  SBBD 2004»
15 years 5 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
129
Voted
CGI
2004
IEEE
15 years 7 months ago
A Versatile and Robust Model for Geometrically Complex Deformable Solids
In this paper, we present a versatile and robust model for geometrically complex deformable solids. Our approach can be applied to deformable tetrahedral meshes and to deformable ...
Matthias Teschner, Bruno Heidelberger, Matthias M&...