4894 search results - page 278 / 979 » The Guarding Problem - Complexity and Approximation |
207
click to vote
ISCAS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
176
click to vote
IWANN
1999
Springer
15 years 11 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
193
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
190
click to vote
MTA
2000
15 years 6 months ago
2000
Object-level image retrieval is an active area of research. Given an image, a human observerdoesnot see randomdots of colors. Rather,he she observesfamiliarobjectsin the image. The...
192
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...