Sciweavers

2004 search results - page 152 / 401
» Sampling from large graphs
Sort
View
SIGCOMM
1998
ACM
15 years 7 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
171
Voted
WWW
2009
ACM
16 years 4 months ago
Mining interesting locations and travel sequences from GPS trajectories
The increasing availability of GPS-enabled devices is changing the way people interact with the Web, and brings us a large amount of GPS trajectories representing people's lo...
Yu Zheng, Lizhu Zhang, Xing Xie, Wei-Ying Ma
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
15 years 9 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...
158
Voted
MST
2011
209views Hardware» more  MST 2011»
14 years 10 months ago
Spreading of Messages in Random Graphs
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
Ching-Lueh Chang, Yuh-Dauh Lyuu
DATE
2010
IEEE
135views Hardware» more  DATE 2010»
15 years 8 months ago
Mapping scientific applications on a large-scale data-path accelerator implemented by single-flux quantum (SFQ) circuits
— To overcome issues originating from the CMOS technology, a large-scale reconfigurable data-path (LSRDP) processor based on single-flux quantum circuits is introduced. LSRDP is ...
Farhad Mehdipour, Hiroaki Honda, Hiroshi Kataoka, ...