Sciweavers

520 search results - page 77 / 104
» Subset Counting in Trees
Sort
View
NETGAMES
2006
ACM
14 years 1 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
ICNP
1998
IEEE
14 years 1 days ago
On-Demand Multicast in Mobile Wireless Networks
In this paper we propose an "on demand" multicast routing protocol for a wireless, mobile, multihop network. The proposed scheme has two key features: (a) it is based on...
Ching-Chuan Chiang, Mario Gerla
BMCBI
2007
156views more  BMCBI 2007»
13 years 8 months ago
Bio: : NEXUS: a Perl API for the NEXUS format for comparative biological data
Background: Evolutionary analysis provides a formal framework for comparative analysis of genomic and other data. In evolutionary analysis, observed data are treated as the termin...
Thomas Hladish, Vivek Gopalan, Chengzhi Liang, Wei...
IWPEC
2010
Springer
13 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
DAM
2010
112views more  DAM 2010»
13 years 7 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson