Sciweavers

384 search results - page 19 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 7 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
TAMC
2010
Springer
14 years 22 days ago
A Note on the Testability of Ramsey's Class
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
Charles Jordan, Thomas Zeugmann
NIPS
2007
13 years 9 months ago
A Spectral Regularization Framework for Multi-Task Structure Learning
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
WCE
2007
13 years 8 months ago
Gauss-Radau Quadrature Rule Using Special Class of Polynomials
— A form of Gauss-Quadrature rule over [0,1] has been investigated that involves the derivative of the integrand at the pre-assigned left or right end node. This situation arises...
M. A. Bokhari, Asghar Qadir
STRINGOLOGY
2008
13 years 9 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter