Sciweavers

970 search results - page 116 / 194
» On encodings of spanning trees
Sort
View
ISCC
2005
IEEE
114views Communications» more  ISCC 2005»
14 years 2 months ago
Localized Broadcast Incremental Power Protocol for Wireless Ad Hoc Networks
— As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is o...
François Ingelrest, David Simplot-Ryl
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 10 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
PLANX
2008
13 years 10 months ago
XML Type Checking for Macro Tree Transducers with Holes
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
Sebastian Maneth, Keisuke Nakano
CI
2005
99views more  CI 2005»
13 years 8 months ago
Automatically Generating Tree Adjoining Grammars from Abstract Specifications
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
Fei Xia, Martha Palmer, K. Vijay-Shanker