Sciweavers

580 search results - page 109 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
WWW
2008
ACM
16 years 2 months ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 8 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
15 years 8 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
WABI
2005
Springer
120views Bioinformatics» more  WABI 2005»
15 years 7 months ago
Multiple Structural RNA Alignment with Lagrangian Relaxation
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...
Markus Bauer, Gunnar W. Klau, Knut Reinert
AFRIGRAPH
2003
ACM
15 years 6 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...