2283 search results - page 223 / 457 » Bounds of Graph Characteristics |
107
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
111
click to vote
ICDM
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
143
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
150
click to vote
MICRO
2006
IEEE
15 years 9 months ago
2006
IEEE
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
139
Voted
STOC
2006
ACM
15 years 9 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...