• Breaking News

    Friday, January 1, 2021

    Home Unlabelled CompSci Weekend SuperThread (January 01, 2021) Computer Science

    CompSci Weekend SuperThread (January 01, 2021) Computer Science

    January 01, 2021

    CompSci Weekend SuperThread (January 01, 2021) Computer Science

    CompSci Weekend SuperThread (January 01, 2021)

    Posted: 31 Dec 2020 05:04 PM PST

    /r/compsci strives to be the best online community for computer scientists. We moderate posts to keep things on topic.

    This Weekend SuperThread provides a discussion area for posts that might be off-topic normally. Anything Goes: post your questions, ideas, requests for help, musings, or whatever comes to mind as comments in this thread.

    Pointers

    • If you're looking to answer questions, sort by new comments.
    • If you're looking for answers, sort by top comment.
    • Upvote a question you've answered for visibility.
    • Downvoting is discouraged. Save it for discourteous content only.

    Caveats

    • It's not truly "Anything Goes". Please follow Reddiquette and use common sense.
    • Homework help questions are discouraged.
    submitted by /u/AutoModerator
    [link] [comments]

    [R] Japanese Manga Translation Via Multimodal Context-Aware Framework

    Posted: 31 Dec 2020 11:08 AM PST

    A new machine translation method from Japanese start-up Mantra Inc., Yahoo Japan and the University of Tokyo enables global manga fans to enjoy immediate translations of their favourite Japanese comics. The researchers say this is the first comprehensive system for fully automated manga translation from the original Japanese into English or Chinese.

    Here is a quick read: Japanese Manga Translation Via Multimodal Context-Aware Framework

    The paper Towards Fully Automated Manga Translation is on arXiv.

    submitted by /u/Yuqing7
    [link] [comments]

    Are CS50 course on YouTube different for each year?

    Posted: 31 Dec 2020 09:05 PM PST

    I wanted to learn about basics/general overview of computer science, just form an educational/learning point of view and not in need of the certificate for the time being, so which year's CS50 on YouTube would be best or are they more or less same.

    submitted by /u/veldamus
    [link] [comments]

    Graph theory terminology: DAG subgraph

    Posted: 01 Jan 2021 01:03 AM PST

    Lets say I have a DAG G and some "start nodes" and "end nodes" in G. Im interested in the subgraph of G that contains all the (directed) paths from any start node to any end node.

    Computing that is easy enough but I wonder wheter this kind of subgraph has a special name? (Eg "induced" subgraph would not be correct here?)

    submitted by /u/Droggl
    [link] [comments]

    Death of 2020 and welcome to 2021 feel me

    Posted: 01 Jan 2021 03:46 AM PST

    From Software Engineering To Artificial Intelligence — Making The Career Move

    Posted: 31 Dec 2020 08:31 PM PST

    If we wanted to use ipv6 as inefficiently as possible, could we run out of addresses any time soon?

    Posted: 31 Dec 2020 01:23 PM PST

    I know that undecillion is a pretty large number, but if one had the goal of gobbling up as many addresses as possible in THE MOST inefficient way possible, does any current tech even possess the ability to use a noticeable amount of ipv6 addresses? I'm not just saying allocating them poorly and not using them. I guess a part of my question would be what's the smallest amount of processing power needed to use an ipv6 address and does the amount of computing power in the world exist to do that?

    I don't know if my question is clear enough, I don't know much technical detail I just got a weird brainworm and was curious.

    ​

    Edit: word

    submitted by /u/Koolaidguy31415
    [link] [comments]

    Question about Extra Storage Space in Merge function

    Posted: 31 Dec 2020 02:13 PM PST

    Why doesn't my program end when I enter EOF on windows?

    Posted: 31 Dec 2020 06:25 PM PST

    https://ibb.co/x1FzKG5 

    #include"myheader.h" int main(){ FILE* p=fopen("input.txt","r"); int n; char nstr[10]; fgets(nstr,10,p); n=atoi(nstr); int arr[n]; int i; for(i=0;i<n;i++){ fscanf(p," %d",&arr[i]); } mysort(arr,n); printf("Sorted finish.\n"); int target,result; while(1){ printf("Please input your target: "); scanf(" %d",&target); if(feof(stdin)){ break; } result=myBinarySearch(arr,target,0,n-1); if(result==-1){ printf("target not found.\n"); }else{ printf("target found at index %d.\n",result); } } fclose(p); }
    submitted by /u/JacksonSteel
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment