Computer Science
ihadanny's user avatar
ihadanny's user avatar
ihadanny's user avatar
ihadanny
  • Member for 7 years, 1 month
  • Last seen more than a month ago
  • Israel
Profile Activity
Stats
369
reputation
50k
reached
3
answers
7
questions
Communities
View all
About

bak bak bak

@idohadanny

Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
13
bronze badges
Top tags
View all tags
17
Score
3
Posts
30
Posts %
17
Score
3
Posts
30
Posts %
17
Score
1
Posts
10
Posts %
1
Score
3
Posts
30
Posts %
1
Score
2
Posts
20
Posts %
1
Score
2
Posts
20
Posts %
Top posts
All Questions Answers
Score Newest
answer
17
BIT: What is the intuition behind a binary indexed tree and how was it thought about?
Aug 4, 2018
question
3
how does the shap algorithm work in polynomial time?
Dec 11, 2020
question
2
sum of squared distances from mean equals all-pairs sum of square distances?
Nov 1, 2016
question
1
optimal lifted phylogenetic alignment - how to improve time complexity?
Nov 30, 2016
question
1
proving that local sequence alignment can be done in linear space
Feb 18, 2017
question
1
a variant of Fitch's algorithm when it is known that one path has cost 0?
Mar 4, 2017
answer
1
how does the shap algorithm work in polynomial time?
Dec 15, 2020
question
0
center star alignment induces optimal alignments on pairs with the center string?
Nov 27, 2016
question
0
find if a string is periodic using a suffix tree, and prove it
Jan 20, 2017
answer
0
center star alignment induces optimal alignments on pairs with the center string?
Nov 29, 2016
Top network posts
View all network posts
71
What is the proper usage of scale_pos_weight in xgboost for imbalanced datasets?
36
Why is xgboost so much faster than sklearn GradientBoostingClassifier?
35
pandas: how do I select first row in each GROUP BY group?
29
Are trekking poles proven to be helpful?
25
Why is P(A,B|C)/P(B|C) = P(A|B,C)?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.