• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,149
Next 10 →

An extended set of Haar-like features for rapid objection detection

by Rainer Lienhart, Jochen Maydt - IEEE ICIP
"... Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haar-like features. These novel features significantly enrich the simple features of [5] and can also be calculated ef ..."
Abstract - Cited by 577 (4 self) - Add to MetaCart
efficiently. With these new rotated features our sample face detector shows off on average a 10 % lower false alarm rate at a given hit rate. We also present a novel post optimization procedure for a given boosted cascade improving on average the false alarm rate further by 12.5%. 1

Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software

by James Newsome, Dawn Song - In Network and Distributed Systems Security Symposium , 2005
"... Software vulnerabilities have had a devastating effect on the Internet. Worms such as CodeRed and Slammer can compromise hundreds of thousands of hosts within hours or even minutes, and cause millions of dollars of damage [32, 51]. To successfully combat these fast automatic Internet attacks, we nee ..."
Abstract - Cited by 647 (32 self) - Add to MetaCart
, and hence works on commodity software. To demonstrate this idea, we have implemented TaintCheck, a mechanism that can perform dynamic taint analysis by performing binary rewriting at run time. We show that TaintCheck reliably detects most types of exploits. We found that TaintCheck produced no false

Nonparametric model for background subtraction

by Ahmed Elgammal, David Harwood, Larry Davis - in ECCV ’00 , 2000
"... Abstract. Background subtraction is a method typically used to seg-ment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the scene background. We present a novel non-parametric background model and a background subtraction approach. The model can ..."
Abstract - Cited by 545 (17 self) - Add to MetaCart
achieves very sensitive detection with very low false alarm rates. Key words: visual motion, active and real time vision, motion detection, non-parametric estimation, visual surveillance, shadow detection 1

How Iris Recognition Works

by John Daugman , 2003
"... Algorithms developed by the author for recogniz-ing persons by their iris patterns have now been tested in six field and laboratory trials, producing no false matches in several million comparison tests. The recognition principle is the failure of a test of statis-tical independence on iris phase st ..."
Abstract - Cited by 509 (4 self) - Add to MetaCart
Algorithms developed by the author for recogniz-ing persons by their iris patterns have now been tested in six field and laboratory trials, producing no false matches in several million comparison tests. The recognition principle is the failure of a test of statis-tical independence on iris phase

High confidence visual recognition of persons by a test of statistical independence

by John G. Daugman - IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract - Cited by 621 (8 self) - Add to MetaCart
-significant bits comprise a 256-byte “iris code. ” Statistical decision theory generates identification decisions from Exclusive-OR comparisons of complete iris codes at the rate of 4000 per second, including calculation of decision confidence levels. The distributions observed empirically in such comparisons

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
in a more gen eral setting? We compare the marginals com puted using loopy propagation to the exact ones in four Bayesian network architectures, including two real-world networks: ALARM and QMR. We find that the loopy beliefs of ten converge and when they do, they give a good approximation

Computational Interpretations of the Gricean Maxims in the Generation of Referring Expressions

by Robert Dale, Ehud Reiter - COGNITIVE SCIENCE , 1995
"... We examine the problem of generating definite noun phrases that are appropriate referring expressions: that is, noun phrases that (a) successfully identify the intended referent to the hearer whilst (b) not conveying to him or her any false conversational implicatures (Grice, 1975). We review severa ..."
Abstract - Cited by 368 (36 self) - Add to MetaCart
We examine the problem of generating definite noun phrases that are appropriate referring expressions: that is, noun phrases that (a) successfully identify the intended referent to the hearer whilst (b) not conveying to him or her any false conversational implicatures (Grice, 1975). We review

Human DNA methylomes at base resolution show widespread epigenomic differences.

by Ryan Lister , Mattia Pelizzola , Robert H Dowen , R David Hawkins , Gary Hon , Julian Tonti-Filippini , Joseph R Nery , Leonard Lee , Zhen Ye , Que-Minh Ngo , Lee Edsall , Jessica Antosiewicz-Bourget , Ron Stewart , Victor Ruotti , A Harvey Millar , James A Thomson , Bing Ren , Joseph R Ecker - Nature, , 2009
"... DNA cytosine methylation is a central epigenetic modification that has essential roles in cellular processes including genome regulation, development and disease. Here we present the first genome-wide, single-base-resolution maps of methylated cytosines in a mammalian genome, from both human embryo ..."
Abstract - Cited by 401 (6 self) - Add to MetaCart
embryonic stem cells 17 and IMR90 fetal lung fibroblasts 18 , generating 1.16 and 1.18 billion reads, respectively, that aligned uniquely to the human reference sequence (NCBI build 36/HG18). The total sequence yield was 87.5 and 91.0 gigabases (Gb), with an average read depth of 14.23 and 14.83 per strand

EXE: Automatically generating inputs of death

by Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, Dawson R. Engler - In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS , 2006
"... This article presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input, EXE runs it on symbolic input initially allowed to be anything. As checked code runs, EXE tracks the constraints on ea ..."
Abstract - Cited by 349 (21 self) - Add to MetaCart
This article presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input, EXE runs it on symbolic input initially allowed to be anything. As checked code runs, EXE tracks the constraints

Intrusion Detection via Static Analysis

by David Wagner, Drew Dean , 2001
"... One of the primary challenges in intrusion detection is modelling typical application behavior, so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior. The resul ..."
Abstract - Cited by 352 (1 self) - Add to MetaCart
One of the primary challenges in intrusion detection is modelling typical application behavior, so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior
Next 10 →
Results 1 - 10 of 7,149
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University