523 search results - page 28 / 105 » On the Signal Bounding Problem in Timing Analysis |
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this work we propose the use of Functional Data Analysis (FDA) as a powerful methodology to tackle problems where multiple continuous speech parameters have to be analyzed join...
127
click to vote
TIT
2010
14 years 8 months ago
2010
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
108
click to vote
STACS
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
163
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
118
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...