5100 search results - page 542 / 1020 » The Linear Complexity of a Graph |
159
click to vote
SAS
2004
Springer
16 years 6 days ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
194
Voted
ICDM
2003
IEEE
16 years 4 days ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
144
Voted
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
173
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
174
Voted
CPM
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...