Profile

Cover photo
Cosmin Negruseri
1,337 followers|549,978 views
AboutPostsReviews

Stream

Cosmin Negruseri

Shared publicly  - 
1
Add a comment...

Cosmin Negruseri

Shared publicly  - 
 
11
Add a comment...

Cosmin Negruseri

Shared publicly  - 
 
Bay are afternoon
4
Add a comment...

Cosmin Negruseri

Shared publicly  - 
 

I've selected a few problems for people who'd like to learn the heap data structure.
http://www.infoarena.ro/blog/heaps-shortlist
3
Add a comment...

Cosmin Negruseri

Shared publicly  - 
 
Date: June 2, 2015. Dear ILSVRC community,. This is a follow up to the announcement on May 19, 2015 with some more details and the status of the test server. During the period of November 28th, 2014 to May 13th, 2015, there were at least 30 accounts used by a team from Baidu to submit to the ...
7 comments on original post
1
Add a comment...

Cosmin Negruseri

Shared publicly  - 
6
Add a comment...
In his circles
471 people
Have him in circles
1,337 people
Alex Florescu's profile photo
Andrei Butnărașu's profile photo
Luis Fernandez's profile photo
Deea Andreea's profile photo
Horea Popa's profile photo
Florin Strachinuta's profile photo
Stefan Minzala's profile photo
dana crisstal's profile photo
Martin Lequeux--Gruninger's profile photo

Cosmin Negruseri

Shared publicly  - 
3
Add a comment...

Cosmin Negruseri

Shared publicly  - 
 
Here's a neat problem I've seen again recently.

Given A, a set of n points in the plane, each point having integer coordinates. Come up with an algorithm that colors some of the points in the set red and the remaining points white in such a way that for any straight line L parallel to either one of the coordinate axes the difference (in absolute value) between the numbers of white point and red points on L is not greater than 1.
1
Apurv Verma's profile photo
 
(1) Any rectangular grid can be colored with as few as two colors.
(2) Since any two neighbors along the axis will alternate in colors (because of 1) there can be no more than a difference of one in the coloured points.
Add a comment...

Cosmin Negruseri

Shared publicly  - 
 
Here are a few problems that involve hill climbing or some form of local search. Feel free to suggest others and to discuss solutions.
http://www.infoarena.ro/blog/hill-climbing-shortlist
2
Add a comment...

Cosmin Negruseri

Shared publicly  - 
 
My friend George Nachman ran into this problem recently:

Given a string pattern P and a large text file T, find the shortest substring of T that contains the the characters of P in the same order.

For example:
P = aab
T = abaccacbab
The shortest substring is acbab

How would you design an algorithm that works well in practice?

How does your solution change if P is guaranteed to have distinct characters.

http://www.infoarena.ro/blog/snippet
2
Add a comment...
People
In his circles
471 people
Have him in circles
1,337 people
Alex Florescu's profile photo
Andrei Butnărașu's profile photo
Luis Fernandez's profile photo
Deea Andreea's profile photo
Horea Popa's profile photo
Florin Strachinuta's profile photo
Stefan Minzala's profile photo
dana crisstal's profile photo
Martin Lequeux--Gruninger's profile photo
Links
Other profiles
Contributor to
Basic Information
Gender
Male
9 reviews