Sciweavers

1578 search results - page 279 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
NIPS
2003
13 years 11 months ago
Probabilistic Inference of Speech Signals from Phaseless Spectrograms
Many techniques for complex speech processing such as denoising and deconvolution, time/frequency warping, multiple speaker separation, and multiple microphone analysis operate on...
Kannan Achan, Sam T. Roweis, Brendan J. Frey
EOR
2007
102views more  EOR 2007»
13 years 9 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
DCG
1998
53views more  DCG 1998»
13 years 9 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
JVCIR
2010
177views more  JVCIR 2010»
13 years 8 months ago
Ripplet: A new transform for image processing
Efficient representation of images usually leads to improvements in storage efficiency, computational complexity and performance of image processing algorithms. Efficient represe...
Jun Xu, Lei Yang, Dapeng Wu
SOCIALCOM
2010
13 years 7 months ago
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
Harish Sethu, Alexander Yates