1458 search results - page 186 / 292 » Practical Preference Relations for Large Data Sets |
154
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
153
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
159
click to vote
IEEEPACT
2002
IEEE
15 years 10 months ago
2002
IEEE
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
147
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
136
click to vote
SIGCOMM
1999
ACM
15 years 9 months ago
1999
ACM
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...