Sciweavers

6598 search results - page 94 / 1320
» Graph Theory with Applications
Sort
View
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
15 years 11 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
BVAI
2007
Springer
15 years 10 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...
ICML
1999
IEEE
16 years 5 months ago
Machine-Learning Applications of Algorithmic Randomness
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
Volodya Vovk, Alexander Gammerman, Craig Saunders
PODC
2009
ACM
16 years 5 months ago
Brief announcement: self-assembly as graph grammar as distributed system
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
Aaron Sterling
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
15 years 4 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl