Sciweavers

20 search results - page 4 / 4
» Random Walk with Continuously Smoothed Variable Weights
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 3 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
CGF
2010
218views more  CGF 2010»
13 years 5 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
ISCAS
2011
IEEE
278views Hardware» more  ISCAS 2011»
12 years 8 months ago
A programmable axonal propagation delay circuit for time-delay spiking neural networks
— we present an implementation of a programmable axonal propagation delay circuit which uses one first-order logdomain low-pass filter. Delays may be programmed in the 550ms rang...
Runchun Wang, Craig T. Jin, Alistair McEwan, Andr&...
CORR
2011
Springer
234views Education» more  CORR 2011»
13 years 12 hour ago
Mutual Information, Relative Entropy, and Estimation in the Poisson Channel
Let X be a non-negative random variable and let the conditional distribution of a random variable Y , given X, be Poisson(γ · X), for a parameter γ ≥ 0. We identify a natural...
Rami Atar, Tsachy Weissman
FSTTCS
2007
Springer
13 years 11 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
Anand Srivastav, Sören Werth