2638 search results - page 88 / 528 » Random Geometric Complexes |
133
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
127
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
135
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
147
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
124
click to vote
TSP
2010
14 years 11 months ago
2010
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...