1101 search results - page 96 / 221 » Comparing Computer Models Solving Number Series Problems |
120
click to vote
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
115
click to vote
CIMAGING
2010
15 years 3 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
122
click to vote
ISLPED
1996
ACM
15 years 6 months ago
1996
ACM
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
ACL
2010
15 years 9 days ago
2010
Letter-substitution ciphers encode a document from a known or hypothesized language into an unknown writing system or an unknown encoding of a known writing system. It is a proble...
135
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...