Sciweavers

559 search results - page 81 / 112
» Augmented Marked Graphs
Sort
View
CVPR
2007
IEEE
15 years 1 days ago
Topology matching for 3D video compression
This paper presents a new technique to reduce the storage cost of high quality 3D video. In 3D video [12], a sequence of 3D objects represents scenes in motion. Every frame is com...
Tony Tung, Francis Schmitt, Takashi Matsuyama
AIRWEB
2009
Springer
14 years 4 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
COLT
2007
Springer
14 years 4 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
CONEXT
2009
ACM
13 years 11 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 8 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...