3875 search results - page 755 / 775 » Approximation algorithms for the 0-extension problem |
83
Voted
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
SRDS
2008
IEEE
15 years 4 months ago
2008
IEEE
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
113
click to vote
MM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...