Sciweavers

2430 search results - page 83 / 486
» Computing Tutte Polynomials
Sort
View
115
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 9 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph
95
Voted
DCC
2007
IEEE
16 years 2 months ago
Planar polynomials for commutative semifields with specified nuclei
We consider the implications of the equivalence of commutative semifields of odd order and planar Dembowski-Ostrom polynomials. This equivalence was outlined recently by Coulter an...
Robert S. Coulter, Marie Henderson, Pamela Kosick
113
Voted
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
15 years 9 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
SIAMJO
2008
108views more  SIAMJO 2008»
15 years 2 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
CASC
2005
Springer
113views Mathematics» more  CASC 2005»
15 years 8 months ago
Real Solving of Bivariate Polynomial Systems
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Ioannis Z. Emiris, Elias P. Tsigaridas