8413 search results - page 350 / 1683 » Ordering Problem Subgoals |
178
click to vote
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
15 years 6 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
170
click to vote
JSW
2007
15 years 6 months ago
2007
— Active databases have been used in many different fields to accomplish many different tasks. One of the main problems today that still have not been solved is authorization. In...
151
click to vote
DCG
1998
15 years 6 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
161
click to vote
SCP
1998
15 years 6 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
129
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...