Sciweavers

887 search results - page 19 / 178
» A Time for Choosing
Sort
View
EJASP
2010
92views more  EJASP 2010»
13 years 2 months ago
Optimized Paraunitary Filter Banks for Time-Frequency Channel Diagonalization
We adopt the concept of channel diagonalization to time-frequency signal expansions obtained by DFT filter banks. As a generalization of the frequency domain channel representatio...
Ziyang Ju, Thomas Hunziker, Dirk Dahlhaus
FCT
1995
Springer
13 years 11 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
ICPR
2002
IEEE
14 years 8 months ago
Improved MSEL and its Medical Application
Edge detection is the basic operation in the image processing and analysis. Multiresolution Sequential Edge Linking (MSEL), which is proposed by Edward J.Delp of Purdue University...
Huiguang He, Jie Tian, Jing Wang, Hong Chen, X. P....
DALT
2008
Springer
13 years 9 months ago
Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
The core capability of a rational agent is to choose its next action in a rational fashion, a capability that can be put to good use by a designer to satisfy the design objectives ...
Koen V. Hindriks, M. Birna van Riemsdijk
COLOGNETWENTE
2010
13 years 6 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik