Sciweavers

173 search results - page 31 / 35
» Asymptotic classes of finite structures
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 8 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
139
Voted
ITSL
2008
15 years 5 months ago
A Randomized Complexity-theoretic Model of Bio-inspired Mobile Epidemics via Close Contact
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Zhen Cao, Jiejun Kong, Mario Gerla, Dapeng Wu
UAI
2008
15 years 5 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
EJC
2007
15 years 4 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
MCS
2005
Springer
15 years 9 months ago
A Probability Model for Combining Ranks
Mixed Group Ranks is a parametric method for combining rank based classiers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
Ofer Melnik, Yehuda Vardi, Cun-Hui Zhang