Sciweavers

2079 search results - page 215 / 416
» Universality of random graphs
Sort
View
SIGCOMM
2010
ACM
15 years 6 months ago
Unbiased sampling in directed social graph
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
Tianyi Wang, Yang Chen, Zengbin Zhang, Peng Sun, B...
CMOT
2004
141views more  CMOT 2004»
15 years 6 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
ACCV
2006
Springer
16 years 17 days ago
Markovian Framework for Foreground-Background-Shadow Separation of Real World Video Scenes
Abstract. In this paper we give a new model for foreground-background-shadow separation. Our method extracts the faithful silhouettes of foreground objects even if they have partly...
Csaba Benedek, Tamás Szirányi
IPCV
2007
15 years 8 months ago
Quantization Based Blind Watermarking Algorithm Using DWT
- In this paper a Discrete Wavelet Transform based blind watermarking algorithm is proposed for embedding a grayscale watermark into a grayscale image. A new approach of choosing t...
Shikha Tripathi, Sai Krishnan Ramachandran, Vijay ...
STACS
2007
Springer
16 years 21 days ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...