Sciweavers

122 search results - page 7 / 25
» Definability in the Infix Order on Words
Sort
View
JAPLL
2008
101views more  JAPLL 2008»
13 years 7 months ago
Circle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
Bruno Courcelle
SIAMSC
2010
155views more  SIAMSC 2010»
13 years 2 months ago
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
Berkant Savas, Lek-Heng Lim
DM
2008
58views more  DM 2008»
13 years 7 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
ICONIP
2009
13 years 5 months ago
Application-Driven Parameter Tuning Methodology for Dynamic Neural Field Equations
In this paper, a method is introduced in order to qualify the performance of dynamic neural fields (DNF). The method is applied to Amari's DNF equations, in order to drive the...
Lucian Alecu, Hervé Frezza-Buet
ACL
2010
13 years 5 months ago
Extraction and Approximation of Numerical Attributes from the Web
We present a novel framework for automated extraction and approximation of numerical object attributes such as height and weight from the Web. Given an object-attribute pair, we d...
Dmitry Davidov, Ari Rappoport