Sciweavers

15254 search results - page 113 / 3051
» A k
Sort
View
PAKDD
2011
ACM
214views Data Mining» more  PAKDD 2011»
14 years 20 days ago
Spectral Analysis of k-Balanced Signed Graphs
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
Leting Wu, Xiaowei Ying, Xintao Wu, Aidong Lu, Zhi...
ICC
2011
IEEE
236views Communications» more  ICC 2011»
13 years 9 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 8 days ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
14 years 9 months ago
On a Combinatorial Problem of Asmus Schmidt
For any integer r 2, define a sequence of numbers {c (r) k }k=0,1,..., independent of the parameter n, by n k=0 n k r n + k k r = n k=0 n k n + k k c (r) k , n = 0, 1, 2, . . . ....
W. Zudilin