1026 search results - page 6 / 206 » On Finding Minimal w-cutset |
LATIN
2010
Springer
14 years 25 days ago
2010
Springer
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we consider the problem of direction finding in multiple-input multiple-output (MIMO) radar based on focusing the transmitted pulse energy within certain spatial s...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Testing and debugging database software is often challenging and time consuming. A very arduous task for DB testers is finding a min-repro ? the "simplest possible setup"...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...