4797 search results - page 206 / 960 » The complexity of partition tasks |
165
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
121
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
As the density and complexity of FPGA-based designs has increased to 10,000 gates and beyond, the use of high-level design languages (HDLs) is rapidly supplanting schematic entry ...
169
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
178
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
The difficulty of scaling Online Social Networks (OSNs) has introduced new system design challenges that has often caused costly re-architecting for services like Twitter and Face...
164
click to vote
CACM
2006
15 years 6 months ago
2006
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...