face detection Face detection can be regarded as a more general case of face localization In face localization, the task is to find the locations and sizes of a known number of faces (usually one). In face detection, one does not have this additional information. Early face-detection algorithms focused on the detection of frontal human faces, whereas newer algorithms attempt to solve the more general and difficult problem of multi-view face detection. That is, the detection of faces that are either rotated along the axis from the face to the observer (in-plane rotation), or rotated along the vertical or left-right axis (out-of-plane rotation),or both.
标签： detection face localization regarded
上传时间： 2014-01-10
上传用户：wfeel
This file for experiment of C8051 Microcontroller(SILABS company) with USB interface that use keil programming if you have some problem for this file, please contact me with sofa24@hotmail.com
标签： Microcontroller experiment interface company
上传时间： 2017-08-24
上传用户：woshini123456
卡耐基.梅隆大学的牛发写的关于孤立点和数据清洗的文章，全英文，2003年完成，Probabilistic Noise Identification and Data Cleaning，Real world data is never as perfect as we would like it to be and can often suffer from corruptions that may impact interpretations of the data, models created from the data, and decisions made based on the data. One approach to this problem is to identify and remove records that contain corruptions. Unfortunately, if only certain fields in a record have been corrupted then usable, uncorrupted data will be lost. In this paper we present LENS, an approach for identifying corrupted fields and using the remaining noncorrupted fields for subsequent modeling and analysis.
上传时间： 2017-08-29
上传用户：thinode
The Fortran 90 Handbook is a definitive and comprehensive guide to Fortran 90 and its use. Fortran 90, the latest standard version of Fortran, has many excellent new features that will assist the programmer in writing efficient, portable, and maintainable programs. The Fortran 90 Handbook is an informal description of Fortran 90, developed to provide not only a readable explanation of features, but also some rationale for the inclusion of features and their use. In addition, “models” give the reader better insight as to why things are done as they are in the language.
标签： Fortran comprehensive definitive and
上传时间： 2014-01-14
上传用户：huannan88
RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, public key and private key. Public key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (public key), n=pq Descryption (D) . D=C° mod(n), o = d (private key
标签： crypthograph information Adleman Rivest
上传时间： 2017-09-01
上传用户：chfanjiang
The many variants of the Unix operating system require use of a mode of thought that s significantly different from the one that s required by simpler operating systems. Think Unix introduces readers to important fundamental and intermediate Unix commands and, in the process, inculcates them in the Unix way of thinking. It s a worthy goal in a world with more Linux users than ever, and author Jon Lasser accomplishes it. He s both a capable writer and a knowledgeable user of Unix shell commands. Lasser uses bash under Red Hat Linux in most examples--which usually apply equally well to other Unix variants--and makes asides about other shells and environments, as needed.
标签： significantly operating variants of
上传时间： 2017-09-04
上传用户：qq521
A sparse variant of the Levenberg-Marquardt algorithm implemented by levmar has been applied to bundle adjustment, a computer vision/photogrammetry problem that typically involves several thousand variables
标签： Levenberg-Marquardt implemented algorithm applied
上传时间： 2013-12-23
上传用户：wqxstar
JAVA_3，read and writer JAVA_3，read and writer JAVA_3，read and writer
标签： JAVA
上传时间： 2017-09-26
上传用户：cjf0304
自主移动机器人是目前机器人发展的主流，随着其应用领域的不断扩展和自动化程度的进一步提高，对机器人的功能提出了更高的要求，特别是需要各种具有不同智能程度的机器人，能够设定自己的目标，规划并执行自己的任务动作，不断适应环境的变化。在移动机器人相关技术研究中，导航技术是其核心，而路径规划是导航技术研究的一个重要环节和组成部分。路径规划是智能移动机器人研究的核心内容之一，它起始于20世纪70年代，迄今为止，已有大量的研究成果报道[1]。大多数国内外文献将此问题称为Path Planning，Find-Path Problem， Collision-Free，Obstacle Avoidance，Motion Planning，etc．。所谓移动机器人路径规划技术，是指移动机器人在一定的环境（通常具有障碍物）中，能够按照某种标准，如工作代价最小、行走路线最短、行走时间最短等，自行规划出一条到达指定终点的无碰路径，同时高效完成作业任务。
标签： 机器人；路径
上传时间： 2015-03-16
上传用户：Freesky1
Convex optimization problem
标签： Convex optimization
上传时间： 2015-03-23
上传用户：飞来大货车
