1941 search results - page 253 / 389 » On the Hardness of Approximate Reasoning |
179
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
227
Voted
MIR
2010
ACM
16 years 1 months ago
2010
ACM
Typical tag recommendation systems for photos shared on social networks such as Flickr, use visual content analysis, collaborative filtering or personalization strategies to prod...
186
click to vote
IPSN
2007
Springer
16 years 1 months ago
2007
Springer
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
166
Voted
MLG
2007
Springer
16 years 1 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
264
click to vote
SSD
2007
Springer
16 years 1 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...