2412 search results - page 182 / 483 » Which Problems Have Strongly Exponential Complexity |
145
Voted
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
146
click to vote
TCSV
2010
14 years 10 months ago
2010
We propose a compressed domain video object segmentation method for MPEG or MPEG-like encoded videos. Computational superiority is the main advantage of the compressed domain proc...
109
Voted
APIN
2002
15 years 3 months ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
170
Voted
SPRINGSIM
2010
15 years 2 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
150
click to vote
INFOCOM
2011
IEEE
14 years 7 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....