352 search results - page 64 / 71 » Experimental Analysis of Approximation Algorithms for the Ve... |
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Social bookmarking is the process through which users share tags for online resources like blogs with others. Such collaborative tags provide valuable metadata for retrieval syste...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
BMCBI
2010
13 years 7 months ago
2010
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...