Sciweavers

1321 search results - page 15 / 265
» Quadratic forms on graphs
Sort
View
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 3 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
CAGD
2007
75views more  CAGD 2007»
13 years 8 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
PKDD
2010
Springer
194views Data Mining» more  PKDD 2010»
13 years 6 months ago
Weighted Symbols-Based Edit Distance for String-Structured Image Classification
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
Cécile Barat, Christophe Ducottet, É...
APPROX
2011
Springer
249views Algorithms» more  APPROX 2011»
12 years 8 months ago
A Canonical Form for Testing Boolean Function Properties
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
Dana Dachman-Soled, Rocco A. Servedio
RTA
2010
Springer
13 years 10 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater