2,922 reputation
1023
bio website geomblog.blogspot.com
location Salt Lake City
age 43
visits member for 4 years, 11 months
seen 10 hours ago
CS prof. Interested in algorithms and computational geometry. Also non-Euclidean geometry and spaces of distributions

Jul
2
awarded  Curious
Apr
19
awarded  Enlightened
Apr
19
awarded  Nice Answer
Apr
8
comment Euclidean embedding of a graph based on 1-ring neighborhood distances only
"If $l_{ij}$ were a complete matrix, multidimensional scaling would yield an embedding into $\mathbb{R}^3$, such that Euclidean distances correspond to $l_{ij}$.". I'm not sure why this is true. There are plenty of graphs that cannot be embedded (I assume you mean isometrically) into 3-space.
Apr
3
comment How to estimate the entropy of a distribution on a power set?
It's not relevant for computing the entropy that the power set structure is useful for applications. Since you haven't indicated that the power set structure has any constraints, then as @usul points out it's equivalent to having an arbitrary collection of integers in a larger set.
Apr
3
answered How to estimate the entropy of a distribution on a power set?
Mar
19
comment Does high min degree and high odd girth imply near bipartiteness?
I'm confused. How is a graph bipartite if it has any odd cycle ?
Mar
6
comment Integer point in a non-empty polytope
This problem is NP-complete, so you're unlikely to find a good algorithm without more info about how the polytope is constructed.
Mar
1
comment Distance measure for noisy $SE(3)$ transforms
Are you trying to define a new distance on the underlying space or a distance between a point and its distribution of transforms ?
Feb
25
comment Similarity of weighted graphs
Treating a weighted graph as a matrix has the problem that you lose permutation invariance (or that you have to explicitly encode permutation invariance into your distance function).
Feb
24
comment Is this function of a matrix convex?
But $A$ is not symmetric (the question requires symmetric matrices)
Feb
19
answered Finding minimal number of expressions (a minimum spanning tree-like problem)
Feb
17
comment Higher-order dimension in posets: a reference request
added formal definition.
Feb
17
revised Higher-order dimension in posets: a reference request
added clarification in response to comment from user46855
Feb
13
comment What Turing-Complete models of computation carry a notion of time complexity that “agrees” with that of Turing Machines?
The problem is: I'm not sure what "fastest Turing machine to solve the problem means" for (say) an NP-hard problem. If I give you a machine that (among other things) can implement algorithms for NP-Complete problems in exponential time, does that satisfy your condition (yes, if say the SETH holds) or not ?
Feb
12
answered A combinatorial problem concerned with logic circuits
Dec
26
awarded  Popular Question
Dec
23
accepted Analogy of Parseval identity for Legendre Transform ?
Dec
23
comment Analogy of Parseval identity for Legendre Transform ?
ah I think I get it. Between this and Denis Serre's answer, I think I'm finally seeing it :)
Dec
23
comment Analogy of Parseval identity for Legendre Transform ?
Interesting. But I'm not sure I see how this even resembles Parseval's ?