Graph Data Management Lab, School of Computer Science Add title here: Large graph processing

Slides:



Advertisements
Similar presentations
Scientific Enquiry, Scientific Process or Problem Solving?
Advertisements

Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
E-2020 Science Classes New Year 2012 Procedures. Vocabulary Write each vocabulary word Each definition, in your own words if possible Draw a picture to.
Correlation Search in Graph Databases Yiping Ke James Cheng Wilfred Ng Presented By Phani Yarlagadda.
More Efficient Generation of Plane Triangulations Shin-ichi Nakano Takeaki Uno Gunma University National Institute of JAPAN Informatics, JAPAN 23/Sep/2003.
1 The TSP : Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell ( )
CPSC 413 Fall To learn the material in CPSC 413 and get the grade I’m aiming for will require me to put significant effort into the course.
Lectures on Network Flows
Graph Data Management Lab School of Computer Science , Bristol, UK.
Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.
1 Writing a Paper Michalis Faloutsos. 2 Publishing a paper  Having a good idea is not enough  You need good and clear writing  You need to make clear.
Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique.
PROJECT TITLE Name Use a total of up to 15 slides.
PROJECT TITLE Names. 2 Overview  Background  Result 1  Result 2  Conclusions.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
Algorithmic Problems in Algebraic Structures Undecidability Paul Bell Supervisor: Dr. Igor Potapov Department of Computer Science
Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique.
Department of Computer Science & Engineering College of Engineering Dr. Betty H.C. Cheng, Laura A. Campbell, Sascha Konrad The demand for distributed real-time.
Hardness Results for Problems
Science Fair Project Type your project title here Your name Your teacher’s name Your school.
6.2 Solving Inequalities Using Multiplication or Division Goal Solve and graph one-step inequalities in one variable using multiplication or division Key.
CS492: Special Topics on Distributed Algorithms and Systems Fall 2008 Lab 3: Final Term Project.
IMSS005 Computer Science Seminar
Applying creativity in CS high school education - criteria, teaching example and evaluation Romeike, R. (2007). Applying creativity in CS high school education.
A Fast Algorithm for Enumerating Bipartite Perfect Matchings Takeaki Uno (National Institute of Informatics, JAPAN)
Simple and Improved Parameterized Algorithms for Multiterminal Cuts Mingyu Xiao The Chinese University of Hong Kong Hong Kong SAR, CHINA CSR 2008 Presentation,
Computer Science and Engineering - University of Notre Dame Jimmy Neutron CSE 40827/60827 – Ubiquitous Computing November 13, 2009 Project Presentation.
Graph Data Management Lab, School of Computer Science gdm.fudan.edu.cn XMLSnippet: A Coding Assistant for XML Configuration Snippet.
Design and Analysis of Algorithms 4 th Semester Computer Engineering Spring 2015 Conf.dr.ing. Ioana Sora
Technical paper writing for journal and conference submission III Zhen Jiang Department of Computer Science Information Security Center West Chester University.
1/52 Overlapping Community Search Graph Data Management Lab, School of Computer Science
Graph Data Management Lab, School of Computer Science gdm.fudan.edu.cn Luyiqi Locus based alignment storage.
Bellwork.  Why is it important to understand what a responding variable is in an experiment when performing an experiment?
Proving Non-Termination Gupta, Henzinger, Majumdar, Rybalchenko, Ru-Gang Xu presentation by erkan.
Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science.
CSCE790: Security and Privacy for Emerging Ubiquitous Communication system Wenyuan Xu Department of Computer Science and Engineering University of South.
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
PowerPoint presentation title Presenter’s name and date Put a visual here.
Unique Games Approximation Amit Weinstein Complexity Seminar, Fall 2006 Based on: “Near Optimal Algorithms for Unique Games" by M. Charikar, K. Makarychev,
Graph Data Management Lab, School of Computer Science Branch Code: A Labeling Scheme for Efficient Query Answering on Tree
Double click here to add event title Double click here to add event date Double click here to add event time Double click here to add event location.
Paper Title Authors names Conference and Year Presented by Your Name Date.
By: Nelson Webster. Algorithm Engineers Algorithm engineers study the effectiveness and efficiency of procedures of solving problems on a computer.
1 Review of report "LSDX: A New Labeling Scheme for Dynamically Updating XML Data"
Dynamic Programming academy.zariba.com 1. Lecture Content 1.Fibonacci Numbers Revisited 2.Dynamic Programming 3.Examples 4.Homework 2.
Graph Data Management Lab, School of Computer Science Add title here: Large graph processing
Lecture 20 CSE 331 July 30, Longest path problem Given G, does there exist a simple path of length n-1 ?
Science Research Presentation Type your project title here Your name Your teacher’s name Your school.
1 Algorithms CSCI 235, Fall 2015 Lecture 29 Greedy Algorithms.
Pitfalls of your first paper Shu Cai Institute of Computing Technology, Chinese Academy of Sciences
Design and Analysis of Algorithms 4 th Semester Computer Engineering Spring 2016 Conf.dr.ing. Ioana Ṣ ora
OPTIMAL LINEAR-TIME QOS- BASED SCHEDULING FOR WIMAX Arezou Mohammadi, Selim G. Akl, Firouz Behnamfar School of Computing, Queen’s University CCECE 2008.
The most important work in Operating Systems
Dynamic Programming Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
The most important work in Software Verification
Definition of a Polynomial Inequality
Here is the graph of a function
Computability and Complexity
A. P. Shah Institute of Technology
College of Engineering Cherthala
Project Title, date “Team Name: Team members, …”
Zhenjiang Lin, Michael R. Lyu and Irwin King
Algorithms CSCI 235, Spring 2019 Lecture 29 Greedy Algorithms
POWER CHALLENGES Several Ways To Solve 7 CHALLENGES.
<insert title> < presenter name >
Inductive Clustering: A technique for clustering search results Hieu Khac Le Department of Computer Science - University of Illinois at Urbana-Champaign.
                                                                                        Global sensitivity analysis and uncertainty quantification for.
Why We Need Car Parking Systems - Wohr Parking Systems
Types of Stack Parking Systems Offered by Wohr Parking Systems
Add Title.
Presentation transcript:

Graph Data Management Lab, School of Computer Science Add title here: Large graph processing Put conference information here: The 12-th International Conference of Date Engineering Version 2 ( ) Yanghua xiao A template of status report

2 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Summary of works before this checkpoint  What you have done before this checkpoint? Papers that you read Problems that you studied Exp that you have done Major results that you have obtained

3 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Motivation of Problem  Why you study this problem?

4 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Related works  How did people solve this problem in the previous works?  Survey of any other related works Problems that is similar to your works Techniques that used in your solution Any other related works

5 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Problem definition  Formal definition  Property of proposed problem  Is this problem novel Difference of this problem to the related problem  Does this problem deserve our research efforts? Challenges of this problem Is this problem NP-hard? If so, give the proof

6 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Baseline Solution  What is the naive solution to solve this problem  Why this solution is unacceptable? Complexity Salability Or any other issues

7 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Your solution  Basic idea of your solution Example if exists  Algorithm framework of your solution

8 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Key technique of your solution  For each technique, give the following Rationality of this technique Procedure of the technique Can we prove the efficiency or effectiveness of your solution? If so, give them Optimization of your technique when handle large data or dynamic data

9 Add title here: Large graph processing The 12-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science Graph Data Management Lab, School of Computer Science Planning of next step  What you plan to do as the next step?  Checkpoint  Delivery