3946 search results - page 316 / 790 » The computational complexity of choice sets |
201
click to vote
TCS
2010
15 years 1 months ago
2010
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...
166
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
199
click to vote
ACNS
2003
Springer
15 years 10 months ago
2003
Springer
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
190
click to vote
CIBCB
2008
IEEE
15 years 8 months ago
2008
IEEE
The concept of a network motif--a small set of interacting genes which produce a predictable behaviour at the network level--has attracted considerable attention amongst network an...
153
Voted
JCIT
2007
15 years 6 months ago
2007
Queue computers are a viable option for embedded systems design. Queue computers feature a dense instruction set, high parallelism, low hardware complexity. In this paper we propo...