Sciweavers

202 search results - page 26 / 41
» Performance-Driven Partitioning Using a Replication Graph Ap...
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
ICALP
2009
Springer
14 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
SPIN
2010
Springer
13 years 5 months ago
Efficient Explicit-State Model Checking on General Purpose Graphics Processors
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU). In contrast to existing approaches en...
Stefan Edelkamp, Damian Sulewski
ICDCSW
2007
IEEE
14 years 1 months ago
Object-Swapping for Resource-Constrained Devices
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...
Luís Veiga, Paulo Ferreira
TON
2008
122views more  TON 2008»
13 years 7 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano