Sciweavers

915 search results - page 10 / 183
» Maximally Abstract Retrenchments
Sort
View
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
14 years 1 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
ICC
2009
IEEE
175views Communications» more  ICC 2009»
14 years 2 months ago
Effective Capacity Maximization in Multi-Antenna Channels with Covariance Feedback
Abstract—The optimal transmit strategies of single-user multiantenna systems with respect to average capacity maximization are well understood. However, the performance measure d...
Eduard A. Jorswieck, Rami Mochaourab, Martin Mitte...
DAWAK
2004
Springer
14 years 1 months ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
ICC
2007
IEEE
115views Communications» more  ICC 2007»
14 years 2 months ago
Space-Time Coded Cooperative Multicasting with Maximal Ratio Combining and Incremental Redundancy
Abstract— The performance of wireless multicasting is negatively affected by multipath fading. To improve reliability, cooperation among the nodes of the network can be used to c...
Aitor del Coso, Osvaldo Simeone, Yeheskel Bar-Ness...
LCPC
1993
Springer
13 years 12 months ago
Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution
Abstract. Loop fusion is a program transformation that merges multiple loops into one. It is e ective for reducing the synchronization overhead of parallel loops and for improving ...
Ken Kennedy, Kathryn S. McKinley