2465 search results - page 132 / 493 » Automata on Linear Orderings |
100
Voted
CORR
2006
Springer
15 years 26 days ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
140
click to vote
COCO
2011
Springer
14 years 19 days ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
104
click to vote
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
92
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
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...
89
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— This paper proposes low-complexity blind detection for orthogonal frequency division multiplexing (OFDM) systems with the differential space-time block code (DSTBC) under time-...