Sciweavers

5066 search results - page 161 / 1014
» Spectra of structures and relations
Sort
View
MFCS
2007
Springer
15 years 11 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
CSL
2003
Springer
15 years 10 months ago
Constraint Satisfaction with Countable Homogeneous Templates
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
Manuel Bodirsky, Jaroslav Nesetril
DBPL
1993
Springer
141views Database» more  DBPL 1993»
15 years 9 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
159
Voted
COLING
1990
15 years 6 months ago
Unbounded Dependency: Tying strings to rings
: This paper outlines a framework for connectionist representation based on the composition of connectionist states under vector space operators. The framework is used to specify a...
Jon M. Slack
NIPS
2007
15 years 6 months ago
Multi-Task Learning via Conic Programming
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama, ...