244 search results - page 18 / 49 » A Linear Search Strategy using Bounds |
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
IJON
2007
13 years 8 months ago
2007
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
UM
2009
Springer
14 years 3 months ago
2009
Springer
Clustering of search results has been shown to be advantageous over the simple list presentation of search results. However, in most clustering interfaces, the clusters are not ada...