Sciweavers

Share
MST
2011
231views Hardware» more  MST 2011»
8 years 2 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
MST
2011
191views Hardware» more  MST 2011»
8 years 6 months ago
Vertex Cover Problem Parameterized Above and Below Tight Bounds
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia...
MST
2011
237views Hardware» more  MST 2011»
8 years 7 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson
MST
2011
205views Hardware» more  MST 2011»
8 years 7 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...
MST
2011
209views Hardware» more  MST 2011»
8 years 7 months ago
Spreading of Messages in Random Graphs
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
Ching-Lueh Chang, Yuh-Dauh Lyuu
MST
2011
182views Hardware» more  MST 2011»
8 years 7 months ago
Tilings and Submonoids of Metabelian Groups
Abstract. In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product Z ≀ (Z × Z). ...
Markus Lohrey, Benjamin Steinberg
MST
2011
184views Hardware» more  MST 2011»
8 years 7 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
MST
2011
208views Hardware» more  MST 2011»
8 years 7 months ago
Weighted Picture Automata and Weighted Logics
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...
Ina Fichtner
MST
2011
200views Hardware» more  MST 2011»
8 years 7 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...
books