Sciweavers

3958 search results - page 499 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 10 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
SIGCOMM
2009
ACM
16 years 1 months ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
ISPASS
2006
IEEE
16 years 19 days ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
JCB
2007
118views more  JCB 2007»
15 years 6 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
SIMULATION
2011
15 years 1 months ago
The Activity-tracking paradigm in discrete-event modeling and simulation: The case of spatially continuous distributed systems
From a modelling and simulation perspective, studying dynamic systems consists of focusing on changes in states. According to the precision of state changes, generic algorithms ca...
Alexandre Muzy, Rajanikanth Jammalamadaka, Bernard...