Sciweavers

1159 search results - page 33 / 232
» Binary Decision Graphs
Sort
View
ALGORITHMICA
2002
109views more  ALGORITHMICA 2002»
13 years 8 months ago
A Near-Linear Area Bound for Drawing Binary Trees
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
Timothy M. Chan
DCOSS
2008
Springer
13 years 10 months ago
On the Deterministic Tracking of Moving Objects with a Binary Sensor Network
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
Yann Busnel, Leonardo Querzoni, Roberto Baldoni, M...
CVPR
2007
IEEE
14 years 11 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
CVPR
2007
IEEE
14 years 11 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
IWMM
2009
Springer
114views Hardware» more  IWMM 2009»
14 years 3 months ago
Scalable support for multithreaded applications on dynamic binary instrumentation systems
Dynamic binary instrumentation systems are used to inject or modify arbitrary instructions in existing binary applications; several such systems have been developed over the past ...
Kim M. Hazelwood, Greg Lueck, Robert Cohn