3591 search results - page 286 / 719 » Typing linear constraints |
223
click to vote
CONSTRAINTS
2007
15 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
184
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
Constrained cepstral systems, which select frames to match various linguistic “constraints” in enrollment and test, have shown significant improvements for speaker verificatio...
149
click to vote
APAL
2010
15 years 7 months ago
2010
We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We characterize "linear" theories in terms of properties of the correspon...
153
click to vote
EOR
2010
15 years 7 months ago
2010
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
257
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...