Sciweavers

148 search results - page 25 / 30
» Linear reductions of maximum matching
Sort
View
85
Voted
JCO
2006
126views more  JCO 2006»
14 years 11 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
ICASSP
2011
IEEE
14 years 3 months ago
SSIM-inspired image denoising using sparse representations
Perceptual image quality assessment (IQA) and sparse signal representation have recently emerged as high-impact research topics in the field of image processing. Here we make one...
Abdul Rehman, Zhou Wang, Dominique Brunet, Edward ...
DGCI
2009
Springer
15 years 2 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
PAMI
2002
114views more  PAMI 2002»
14 years 11 months ago
Principal Manifolds and Probabilistic Subspaces for Visual Recognition
We investigate the use of linear and nonlinear principal manifolds for learning low-dimensional representations for visual recognition. Several leading techniques: Principal Compo...
Baback Moghaddam
CONCUR
1997
Springer
15 years 3 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler