1110 search results - page 156 / 222 » Clustering with the Connectivity Kernel |
206
Voted
DISOPT
2011
14 years 7 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
116
Voted
JSSPP
1995
Springer
15 years 4 months ago
1995
Springer
During the past ve years scientists discovered that modern UNIX workstations connected with ethernet and ber networks could provide enough computational performance to compete wit...
124
Voted
WSDM
2012
ACM
13 years 8 months ago
2012
ACM
Studying relationships between keyword tags on social sharing websites has become a popular topic of research, both to improve tag suggestion systems and to discover connections b...
COLT
2008
Springer
15 years 2 months ago
2008
Springer
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
119
Voted
CLUSTER
2002
IEEE
15 years 12 days ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...