1629 search results - page 74 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ACL
1998
14 years 11 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
BMCBI
2010
14 years 10 months ago
2010
Background: Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic ...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
—The present work describes the analysis, modeling and control of a transformerless Boost-Buck power inverter used as a DC-AC power conditioning stage for grid-connected photovol...
AOSD
2007
ACM
15 years 1 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
DAC
1998
ACM
15 years 10 months ago
1998
ACM
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...