1403 search results - page 102 / 281 » Set cover algorithms for very large datasets |
176
click to vote
JCSS
2008
15 years 4 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
179
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
175
click to vote
AAAI
2000
15 years 5 months ago
2000
Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web ...
164
click to vote
PAMI
2006
15 years 4 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
180
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...