1127 search results - page 98 / 226 » Testing the Expansion of a Graph |
108
click to vote
IPCO
2008
14 years 11 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
Learning temporal causal graph structures from multivariate time-series data reveals important dependency relationships between current observations and histories, and provides a ...
DAM
2008
14 years 10 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
JCB
2008
14 years 10 months ago
2008
Traditionally nonrecombinant genome, i.e., mtDNA or Y chromosome, has been used for phylogeography, notably for ease of analysis. The topology of the phylogeny structure in this c...
EMNLP
2010
14 years 8 months ago
2010
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...