Search found 4 matches

by hwwong
Mon Dec 08, 2008 2:21 am
Forum: Algorithms
Topic: Doubt in the following algorithm
Replies: 4
Views: 1633

Re: Doubt in the following algorithm

mf wrote:Nope. We're looking not just for some real-valued matrix, but for a "matrix of 0s and 1s".
If the equations have a unique solution, simply check if all variables are either 1,0
Otherwise, put free variables as 1 or 0. Then check if the rest of all variables have integral solutions.
by hwwong
Sun Dec 07, 2008 3:50 pm
Forum: Algorithms
Topic: given N circles,how many pairs intersect
Replies: 2
Views: 1639

Re: given N circles,how many pairs intersect

It looks like very hard problem.
Even the following problem, which is a simplification of this one, is very hard: there is a set S of N points on plane, and the query is some circle; we should return number of points from S inside the circle. This problem (which is mentioned in Shamos, Preparata ...
by hwwong
Sun Dec 07, 2008 3:45 pm
Forum: Algorithms
Topic: Doubt in the following algorithm
Replies: 4
Views: 1633

Re: Doubt in the following algorithm

I think this can transformed to a linear algebra problem trivially.
by hwwong
Sun Dec 07, 2008 3:22 pm
Forum: Algorithms
Topic: Clarity required on graph related concepts
Replies: 2
Views: 1419

Re: Clarity required on graph related concepts

Hi,
1)Can you be more specific? Pre-processing can mean anything.
2) The forest generated by DFS traversal such that edges in forests are the forward edges in DFS.
3) I think the following link can help you.
http://www.student.cs.uwaterloo.ca/~cs3 ... Unit17.pdf

Cheers,

Go to advanced search