Sciweavers

1383 search results - page 271 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
CORR
2007
Springer
183views Education» more  CORR 2007»
14 years 10 months ago
A complete set of rotationally and translationally invariant features for images
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
Risi Imre Kondor
JACM
2006
93views more  JACM 2006»
14 years 10 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
DAM
2007
107views more  DAM 2007»
14 years 10 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
JCB
2006
107views more  JCB 2006»
14 years 10 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
IJON
2007
184views more  IJON 2007»
14 years 9 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen