1201 search results - page 174 / 241 » Linear Probing and Graphs |
83
Voted
TIT
2010
14 years 7 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
169
Voted
PAKDD
2011
ACM
14 years 3 months ago
2011
ACM
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
103
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
110
Voted
MOBIHOC
2005
ACM
16 years 6 days ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
111
click to vote
WSDM
2009
ACM
15 years 7 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...