Sciweavers

4 search results - page 1 / 1
» Carrying Umbrellas: An Online Relocation Problem on Graphs
Sort
View
ISAAC
1999
Springer
107views Algorithms» more  ISAAC 1999»
13 years 9 months ago
Carrying Umbrellas: An Online Relocation Problem on Graphs
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
ICASSP
2011
IEEE
12 years 9 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
CCS
2009
ACM
14 years 5 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
COMCOM
1998
83views more  COMCOM 1998»
13 years 4 months ago
System for screening objectionable images
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
James Ze Wang, Jia Li, Gio Wiederhold, Oscar Firsc...