43264 search results - page 8409 / 8653 » Comparing models of computation |
131
click to vote
ICCAD
2009
IEEE
15 years 24 days ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
156
click to vote
AVI
2010
15 years 14 days ago
2010
The procedures to collect information about users are well known in computer science till long time. They range from getting explicit information from users, required in order to ...
134
click to vote
CONNECTION
2010
15 years 13 days ago
2010
Abstract. Despite the great amount of knowledge produced by the neuroscientific literature affective phenomena, current models tackling noncognitive aspects of behavior are often b...
144
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Caenorhabditis elegans gene-based phenotype information dates back to the 1970’s, beginning with Sydney Brenner and the characterization of behavioral and morphologi...
154
click to vote
KAIS
2011
14 years 10 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...