Sciweavers

1366 search results - page 209 / 274
» Modularizing Contexted Constraints
Sort
View
FOSSACS
2009
Springer
15 years 10 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
154
Voted
IPSN
2009
Springer
15 years 10 months ago
Algebraic approach to recovering topological information in distributed camera networks
Camera networks are widely used for tasks such as surveillance, monitoring and tracking. In order to accomplish these tasks, knowledge of localization information such as camera l...
Edgar J. Lobaton, Parvez Ahammad, Shankar Sastry
ICC
2009
IEEE
152views Communications» more  ICC 2009»
15 years 10 months ago
On Concurrent Multipath Transfer in SCTP-Based Handover Scenarios
Abstract—Handling mobility at the transport layer is a promising approach to achieve seamless handover in the context of heterogeneous wireless access networks. In particular, fe...
Lukasz Budzisz, Ramon Ferrús, Ferran Casade...
TIME
2009
IEEE
15 years 10 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 9 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu