Sciweavers

794 search results - page 34 / 159
» Challenges in Parallel Graph Processing
Sort
View
132
Voted
ACL
2000
15 years 7 months ago
Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
Marcel P. van Lohuizen
IPPS
2006
IEEE
16 years 13 days ago
Plan switching: an approach to plan execution in changing environments
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
178
Voted
CONCUR
2006
Springer
15 years 10 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger
ESTIMEDIA
2007
Springer
16 years 17 days ago
Data-Parallel Code Generation from Synchronous Dataflow Specification of Multimedia Applications
Embedded software design for MPSoC needs parallel programming. Popular programming languages such as C and C++ are not adequate for initial specification since they are designed f...
Seongnam Kwon, Choonseung Lee, Soonhoi Ha
SIPS
2007
IEEE
16 years 20 days ago
An Area-Efficient FPGA-Based Architecture for Fully-Parallel Stochastic LDPC Decoding
Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding...
Saeed Sharifi Tehrani, Shie Mannor, Warren J. Gros...