Sciweavers

4894 search results - page 490 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
AINA
2007
IEEE
15 years 11 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
148
Voted
INFOCOM
2007
IEEE
15 years 11 months ago
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hong...
ATAL
2007
Springer
15 years 11 months ago
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
Cuihong Li, Bin Yu, Katia P. Sycara
WABI
2007
Springer
15 years 11 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
SCAM
2006
IEEE
15 years 11 months ago
Normalizing Metamorphic Malware Using Term Rewriting
Metamorphic malware — including certain viruses and worms — rewrite their code during propagation. This paper presents a method for normalizing multiple variants of metamorphi...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...