Sciweavers

5448 search results - page 495 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
ICPR
2004
IEEE
16 years 8 months ago
To FRAME or not to FRAME in Probabilistic Texture Modelling?
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...
193
Voted
ICPR
2000
IEEE
16 years 8 months ago
A Markov Random Field Model for Automatic Speech Recognition
Speech can be represented as a time/frequency distribution of energy using a multi-band filter bank. A Markov random field model, which takes into account the possible time asynch...
Gérard Chollet, Guillaume Gravier, Marc Sig...
179
Voted
DCC
2007
IEEE
16 years 6 months ago
A Simple Statistical Algorithm for Biological Sequence Compression
This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is ma...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris ...
IPPS
2009
IEEE
16 years 1 months ago
Robust CDN replica placement techniques
—Creating replicas of frequently accessed data objects across a read-intensive Content Delivery Network (CDN) can result in reduced user response time. Because CDNs often operate...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...
200
Voted
IPPS
2009
IEEE
16 years 1 months ago
Flexible pipelining design for recursive variable expansion
Many image and signal processing kernels can be optimized for performance consuming a reasonable area by doing loops parallelization with extensive use of pipelining. This paper p...
Zubair Nawaz, Thomas Marconi, Koen Bertels, Todor ...