13306 search results - page 2532 / 2662 » Theoretical Computer Science |
199
click to vote
KDD
2009
ACM
16 years 7 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...
182
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that h...
184
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
186
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
189
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...