Sciweavers

426 search results - page 39 / 86
» Run lengths and liquidity
Sort
View
MFCS
2009
Springer
14 years 4 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
GI
2007
Springer
14 years 4 months ago
About some Benefits of a Crossbearing TMA (XTMA)
: A Bearing-Only TMA running on a submarine, which can exploit the crossbearing effect from sensors installed at different locations needs no own manouevre for convergence, if the ...
Ulrich Steimel
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
14 years 3 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002
ICMCS
2005
IEEE
77views Multimedia» more  ICMCS 2005»
14 years 3 months ago
Rewritable Data Embedding on MPEG Coded Data Domain
In this paper, we propose a rewritable data embedding scheme on MPEG coded data domain for content managements including DRM, content controlling and indexing. Data embedding is p...
Katsuhiro Nakajima, Kiyoshi Tanaka, Tetsuya Matsuo...
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
14 years 3 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler