Sciweavers

5606 search results - page 188 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
16 years 2 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
103
Voted
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 24 days ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
109
Voted
PVLDB
2008
108views more  PVLDB 2008»
15 years 5 days ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
95
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
High-Throughput Non-Orthogonal Interleaved Random Space-Time Coding for Multi-Source Cooperation
Abstract— In this paper, we propose a novel distributed Interleaved Random Space-Time Code (IR-STC) designed for MultiSource Cooperation (MSC) employing various relaying techniqu...
Rong Zhang, Lajos Hanzo
ICIP
2007
IEEE
15 years 7 months ago
Lossy Compression of Bilevel Images Based on Markov Random Fields
A new method for lossy compression of bilevel images based on Markov random fields (MRFs) is proposed. It preserves key structural information about the image, and then reconstru...
Matthew G. Reyes, Xiaonan Zhao, David L. Neuhoff, ...