Sciweavers

106 search results - page 21 / 22
» Almost Square Packing
Sort
View
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
13 years 10 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
NGITS
1997
Springer
13 years 10 months ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 5 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
COMGEO
2004
ACM
13 years 5 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
MP
2011
13 years 21 days ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye