4865 search results - page 464 / 973 » The Complexity of Graph Connectivity |
199
click to vote
CASES
2010
ACM
15 years 5 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
330
click to vote
ECCC
2011
15 years 1 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
184
click to vote
JDCTA
2010
15 years 1 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
201
click to vote
TWC
2010
15 years 1 months ago
2010
We consider a frequency division multiplexed (FDM) system where each user employs a continuous phase modulation (CPM), serially concatenated with an outer code through an interleav...
250
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...