Sciweavers

98 search results - page 1 / 20
» On the Determination of the Optimum Path in Space
Sort
View
COSIT
1995
Springer
103views GIS» more  COSIT 1995»
13 years 8 months ago
On the Determination of the Optimum Path in Space
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
Emmanuel Stefanakis, Marinos Kavouras
GLOBECOM
2007
IEEE
13 years 11 months ago
Optimum Pulse Shaping for OFDM/BFDM Systems Operating in Time Varying Multi-Path Channels
— In this paper, we consider a pulse shaping OFDM/BFDM system operating over doubly dispersive channel. We propose to search the optimal pulse maximizing the signal to interferen...
Imene Trigui, Mohamed Siala, Sofiène Affes,...
ICIP
2006
IEEE
14 years 6 months ago
Optimum Watermark Design by Vector Space Projections
We introduce an optimum watermark embedding technique that satisfies common watermarking requirements such as visual fidelity, sufficient embedding rate, robustness against noise ...
Oktay Altun, Gaurav Sharma, Mark F. Bocko
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
13 years 8 months ago
Matching Subsequences in Trees
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
Philip Bille, Inge Li Gørtz
DGCI
2009
Springer
13 years 7 months ago
A Linear Time and Space Algorithm for Detecting Path Intersection
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
Srecko Brlek, Michel Koskas, Xavier Provenç...