This approach addresses two difficulties simultaneously: 1) the range limitation of mobile robot sensors and 2) the difficulty of detecting buildings in monocular aerial images. With the suggested method building outlines can be detected faster than the mobile robot can explore the area by itself, giving the robot an ability to “see” around corners. At the same time, the approach can compensate for the absence of elevation data in segmentation of aerial images. Our experiments demonstrate that ground-level semantic information (wall estimates) allows to focus the segmentation of the aerial image to Find buildings and produce a ground-level semantic map that covers a larger area than can be built using the onboard sensors.
标签： simultaneously difficulties limitation addresses
上传时间： 2014-06-11
上传用户：waitingfy
MICROSOFT FOUNDATION CLASS LIBRARY : 学生管理系统 ======================================================================== AppWizard has created this 学生管理系统 application for you. This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your application. This file contains a summary of what you will Find in each of the files that make up your 学生管理系统 application. 学生管理系统.dsp This file (the project file) contains information at the project level and is used to build a single project or subproject. Other users can share the project (.dsp) file, but they should export the makefiles locally.
标签： FOUNDATION MICROSOFT LIBRARY CLASS
上传时间： 2013-12-16
上传用户：天涯
function [U,V,num_it]=fcm(U0,X) ％ MATLAB (Version 4.1) Source Code (Routine fcm was written by Richard J. ％ Hathaway on June 21, 1994.) The fuzzification constant ％ m = 2, and the stopping criterion for successive partitions is epsilon =??????. ％*******Modified 9/15/04 to have epsilon = 0.00001 and fix univariate bug******** ％ Purpose:The function fcm attempts to Find a useful clustering of the ％ objects represented by the object data in X using the initial partition in U0.
标签： fcm function Version Routine
上传时间： 2014-11-30
上传用户：二驱蚊器
Implement a phone book system for employees of a company. Your program will output the following menu (1) Enter an employee and a phone pair to the system (2) Lookup an employee s phone number (3) Find out who is/are the person(s) of a given number (4) How many people are currently in the system (5) Delete an employee from the system (6) Output all employees name‐phone pair (7) How many phone numbers total in the current system (8) Quit When
标签： Implement employees following company
上传时间： 2013-12-17
上传用户：zhangliming420
We address the problem of predicting a word from previous words in a sample of text. In particular, we discuss n-gram models based on classes of words. We also discuss several statistical algorithms for assigning words to classes based on the frequency of their co-occurrence with other words. We Find that we are able to extract classes that have the flavor of either syntactically based groupings or semantically based groupings, depending on the nature of the underlying statistics.
标签： predicting particular previous address
上传时间： 2016-12-26
上传用户：xfbs821
Symbian 内存泄露检查及调式教程，Using Hooklogger to Find out where a leave() came from
上传时间： 2013-12-25
上传用户：stampede
银行家算法，弄课程设计的时候搞的，作课设时可以用来参考下，希望有帮助-bankers algorithm to Find curriculum design of the moment when, for the class can be used to set up at the reference, we hope that the help
上传时间： 2014-01-07
上传用户：rishian
This book explains how to write device drivers for the newest members of the MicrosoftWindows family of operating systems using the Windows Driver Model (WDM). In this Introduction, I ll explain who should be reading this book, the organization of the book, and how to use the book most effectively. You ll also Find a note on errors and a section on other resources you can use to learn about driver programming. Looking ahead, Chapter 1 explains how the two main branches of the Windows family operate internally, what a WDM device driver is, and how it relates to the rest of Windows.
标签： MicrosoftWindows the explains drivers
上传时间： 2014-01-04
上传用户：dongqiangqiang
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to Find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
标签： contains Output convex planar
上传时间： 2017-02-19
上传用户：wyc199288
The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. There is a way to split the solution space. There is a way to predict a lower bound for a class of solutions. There is also a way to Find an upper bound of an optimal solution. If the lower bound of a solution exceeds this upper bound, this solution cannot be optimal. Thus, we should terminate the branching associated with this solution.
标签： salesperson principle branchand the
上传时间： 2017-02-19
上传用户：comua
