Sciweavers

179 search results - page 29 / 36
» An Optimal Decomposition Algorithm for Tree Edit Distance
Sort
View
GLOBECOM
2010
IEEE
14 years 7 months ago
Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...
Weifa Liang, Jun Luo, Xu Xu
FCT
2009
Springer
15 years 1 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 2 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
EOR
2007
364views more  EOR 2007»
14 years 9 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
FSTTCS
2003
Springer
15 years 2 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...