Sciweavers

1884 search results - page 5 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 4 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
RECOMB
2007
Springer
15 years 10 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
ASIAN
2004
Springer
78views Algorithms» more  ASIAN 2004»
15 years 3 months ago
A Simple Theory of Expressions, Judgments and Derivations
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
Masahiko Sato
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
15 years 10 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
DCC
2007
IEEE
15 years 9 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...