2766 search results - page 315 / 554 » Algorithms for trigonometric polynomials |
132
Voted
IJFCS
2008
15 years 5 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
139
Voted
JCT
2008
15 years 4 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
154
Voted
JMLR
2006
15 years 4 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
135
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
145
Voted
JCP
2007
15 years 4 months ago
2007
—In this paper, a neural network solution to extract independent components from nonlinearly mixed signals is proposed. Firstly, a structurally constrained mixing model is introd...