3946 search results - page 482 / 790 » The computational complexity of choice sets |
205
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
219
click to vote
AI
2010
Springer
15 years 7 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
180
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
180
click to vote
CODES
2006
IEEE
16 years 25 days ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...
172
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...