Sciweavers

715 search results - page 45 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
PODC
2012
ACM
11 years 11 months ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
13 years 3 months ago
Aggregation-based model reduction of a Hidden Markov Model
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
GRAPHICSINTERFACE
2007
13 years 10 months ago
Spectral graph-theoretic approach to 3D mesh watermarking
We propose a robust and imperceptible spectral watermarking method for high rate embedding of a watermark into 3D polygonal meshes. Our approach consists of four main steps: (1) t...
Emad E. Abdallah, A. Ben Hamza, Prabir Bhattachary...
BMCBI
2008
126views more  BMCBI 2008»
13 years 8 months ago
Relating gene expression data on two-component systems to functional annotations in Escherichia coli
Background: Obtaining physiological insights from microarray experiments requires computational techniques that relate gene expression data to functional information. Traditionall...
Anne M. Denton, Jianfei Wu, Megan K. Townsend, Pre...
ICCV
2001
IEEE
14 years 10 months ago
Feature Selection from Huge Feature Sets
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...
José Bins, Bruce A. Draper