Sony Watchman

Known as: Sony portable tv, Watchman, Watchman (Sony) 
The Sony Watchman was a line of portable pocket televisions trademarked and produced by Sony. The line was introduced in 1982 and discontinued in… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Given a connected polygonal domain P , the watchman route problem is to compute a shortest path or tour for a mobile guard (the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2012
Review
2012
Unconstitutional conditions questions are supposed to be hard and rare. This article contends that, however hard, nearly every… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
BACKGROUND The Watchman Left Atrial Appendage System for Embolic Protection in Patients With AF (PROTECT AF) randomized trial… (More)
  • table 3
  • table 1
  • table 2
  • table 4
  • table 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Given a sequence of <i>k</i> polygons in the plane, a start point <i>s</i>, and a target point, <i>t</i>, we seek a shortest path… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
The (previously studied) notions of secure domination and of weak Roman domination involve the construction of protection… (More)
  • figure 4.1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present the rst polynomial-time algorithm that nds the shortest route in a simple polygon such that all points of the polygon… (More)
  • figure 1
  • figure 4
Is this relevant?
1998
1998
In this paper we explore the application of motion planning techniques in the acquisition of range-images using a mobile robot… (More)
Is this relevant?
1997
1997
We provide a competitive strategy for a mobile robot with vision, that has to explore an unknown simple polygon starting from and… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
We study the problem of finding shortest watchman routes in simple polygons from which polygons are visible. We develop a divide… (More)
Is this relevant?