133 search results - page 11 / 27 » Approximation bounds for Black Hole Search problems |
213
Voted
COMGEO
2004
ACM
15 years 5 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
224
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
251
Voted
SIGMOD
2006
ACM
16 years 6 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...
163
click to vote
SECON
2007
IEEE
16 years 4 days ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
163
click to vote
FOCS
2007
IEEE
16 years 6 days ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...