Sciweavers

370 search results - page 42 / 74
» Mathematical Symbol Indexing
Sort
View
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
14 years 11 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
MM
2004
ACM
101views Multimedia» more  MM 2004»
15 years 3 months ago
Searching notated polyphonic music using transportation distances
We present a method for searching databases of symbolically represented polyphonic music that exploits advantages of transportation distances such as continuity and partial matchi...
Rainer Typke, Remco C. Veltkamp, Frans Wiering
TIT
2008
102views more  TIT 2008»
14 years 9 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
SARA
2009
Springer
15 years 4 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
ISSAC
2007
Springer
121views Mathematics» more  ISSAC 2007»
15 years 3 months ago
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
Eric Robinson, Daniel Kunkle, Gene Cooperman