Sciweavers

4860 search results - page 711 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CVGIP
2004
169views more  CVGIP 2004»
15 years 6 months ago
Contour interpolation by straight skeletons
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
Gill Barequet, Michael T. Goodrich, Aya Levi-Stein...
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 2 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
HPCA
2006
IEEE
16 years 7 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
ATAL
2009
Springer
16 years 1 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
SPAA
2005
ACM
16 years 3 days ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...