Sciweavers

6110 search results - page 939 / 1222
» Approximate Computing
Sort
View
BMCBI
2010
117views more  BMCBI 2010»
15 years 6 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
ICDAR
2011
IEEE
14 years 6 months ago
Three Dimensional Rotation-Free Recognition of Characters
—In this paper, we propose a new method for three dimensional rotation-free recognition of characters in scene. In the proposed method, we employ the Modified Quadratic Discrimi...
Ryo Narita, Wataru Ohyama, Tetsushi Wakabayashi, F...
COMPGEOM
2009
ACM
16 years 1 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
BMCBI
2010
106views more  BMCBI 2010»
15 years 6 months ago
Multiple structure alignment and consensus identification for proteins
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
Ivaylo Ilinkin, Jieping Ye, Ravi Janardan
FOCS
2008
IEEE
16 years 1 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...