Sciweavers

611 search results - page 47 / 123
» The Cardinality Matrix Constraint
Sort
View
ECAI
2008
Springer
14 years 11 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
JDA
2008
101views more  JDA 2008»
14 years 9 months ago
Student-Project Allocation with preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David Manlove, Gregg O'Malley
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
15 years 3 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
COR
2007
134views more  COR 2007»
14 years 9 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
CVPR
2001
IEEE
15 years 11 months ago
Learning Spatially Localized, Parts-Based Representation
In this paper, we propose a novel method, called local nonnegative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual pat...
Stan Z. Li, XinWen Hou, HongJiang Zhang, QianSheng...