272 search results - page 7 / 55 » Minimal Function Graphs are not Instrumented |
68
Voted
EOR
2008
14 years 9 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
102
click to vote
ALENEX
2009
14 years 10 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
107
Voted
JMLR
2008
14 years 9 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
GLVLSI
2007
IEEE
15 years 4 months ago
2007
IEEE
The path-delay fault simulation of functional tests on complex circuits such as current processor-based systems is a daunting task. The amount of computing power and memory needed...
67
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a dereverberation method based on I-divergence minimization, which is particularly suitable for music signals. Existing dereverberation methods, including one ...