Sciweavers

4041 search results - page 34 / 809
» time 2009
Sort
View
ATAL
2009
Springer
16 years 10 days ago
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time
We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common an...
Valentin Goranko, Dmitry Shkatov
COCOON
2009
Springer
16 years 10 days ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
FAW
2009
Springer
180views Algorithms» more  FAW 2009»
16 years 10 days ago
Edge Search Number of Cographs in Linear Time
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
Pinar Heggernes, Rodica Mihai
IWCF
2009
Springer
16 years 9 days ago
Using the ENF Criterion for Determining the Time of Recording of Short Digital Audio Recordings
The Electric Network Frequency (ENF) Criterion is a recently developed forensic technique for determining the time of recording of digital audio recordings, by matching the ENF pat...
Maarten Huijbregtse, Zeno Geradts
IWOCA
2009
Springer
119views Algorithms» more  IWOCA 2009»
16 years 9 days ago
Minimax Trees in Linear Time with Applications
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus i...
Pawel Gawrychowski, Travis Gagie