Sciweavers

3702 search results - page 196 / 741
» All Pairings Are in a Group
Sort
View
BMCBI
2008
175views more  BMCBI 2008»
15 years 6 months ago
Synonym set extraction from the biomedical literature by lexical pattern discovery
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
John McCrae, Nigel Collier
ICIP
2000
IEEE
16 years 8 months ago
First Steps Towards a Self-Dual Morphology
Classical morphology is built up in such a way that all operators occur in pairs, e.g., dilation and erosion, opening and closing, etc. This phenomenon, which is a straightforward...
Henk J. A. M. Heijmans, Renato Keshet
VIS
2007
IEEE
120views Visualization» more  VIS 2007»
16 years 7 months ago
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
Attila Gyulassy, Vijay Natarajan, Valerio Pascuc...
ICPR
2008
IEEE
16 years 7 months ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta
DCC
2008
IEEE
16 years 6 months ago
Homogeneous factorisations of Johnson graphs
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
Maria Cristeta Cuaresma, Michael Giudici, Cheryl E...