1728 search results - page 87 / 346 » Social Computing: Fundamentals and applications |
SIGMOD
2010
ACM
14 years 16 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
DRM
2006
Springer
13 years 11 months ago
2006
Springer
One of the most fundamental problems in computer security is protecting sensitive digital information from unauthorized disclosure. There are a number of challenges, such as spywa...
WS
2008
ACM
13 years 7 months ago
2008
ACM
: The power of the Web is enhanced through the network effect produced as resources link to each other with the value determined by Metcalfe's law. In Web 2.0 applications, mu...
MUM
2009
ACM
14 years 2 months ago
2009
ACM
There are academic and commercial drivers for contextawareness to play a prominent role in the future of mobile services. Implementing a complete model of context remains an unsol...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...