Sciweavers

1215 search results - page 231 / 243
» Combinatorics
Sort
View
TOMS
2010
106views more  TOMS 2010»
14 years 8 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
ACL
2010
14 years 7 months ago
Unsupervised Search for the Optimal Segmentation for Statistical Machine Translation
We tackle the previously unaddressed problem of unsupervised determination of the optimal morphological segmentation for statistical machine translation (SMT) and propose a segmen...
Coskun Mermer, Ahmet Afsn Akn
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 7 months ago
Metric uniformization and spectral bounds for graphs
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
56
Voted
COLING
2010
14 years 4 months ago
Exploiting Paraphrases and Deferred Sense Commitment to Interpret Questions more Reliably
Creating correct, semantic representations of questions is essential for applications that can use formal reasoning to answer them. However, even within a restricted domain, it is...
Peter Clark, Philip Harrison
CEC
2011
IEEE
13 years 9 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon