Sciweavers

523 search results - page 84 / 105
» Improved Approximation Algorithms for Maximum Graph Partitio...
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
BIRTHDAY
2011
Springer
12 years 7 months ago
Algorithmic Aspects of Risk Management
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
Ashish Gehani, Lee Zaniewski, K. Subramani
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 7 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
ICPP
2009
IEEE
14 years 2 months ago
Load Balance in the Phylogenetic Likelihood Kernel
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...
Alexandros Stamatakis, Michael Ott
INFOCOM
2009
IEEE
14 years 2 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston