Sciweavers

9290 search results - page 1589 / 1858
» The Predictability of Data Values
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 8 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
156
Voted
POPL
2012
ACM
14 years 5 days ago
Multiple facets for dynamic information flow
JavaScript has become a central technology of the web, but it is also the source of many security problems, including cross-site scripting attacks and malicious advertising code. ...
Thomas H. Austin, Cormac Flanagan
144
Voted
PLDI
2012
ACM
13 years 7 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
207
Voted
CVPR
2012
IEEE
13 years 7 months ago
Multi-attribute spaces: Calibration for attribute fusion and similarity search
Recent work has shown that visual attributes are a powerful approach for applications such as recognition, image description and retrieval. However, fusing multiple attribute scor...
Walter J. Scheirer, Neeraj Kumar, Peter N. Belhume...
BMCBI
2005
108views more  BMCBI 2005»
15 years 4 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
« Prev « First page 1589 / 1858 Last » Next »