Sciweavers

1136 search results - page 8 / 228
» Finding Small Holes
Sort
View
CCCG
2009
13 years 11 months ago
Inapproximability of the Perimeter Defense Problem
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
CDC
2008
IEEE
166views Control Systems» more  CDC 2008»
13 years 11 months ago
Distributed coverage verification in sensor networks without location information
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
Alireza Tahbaz-Salehi, Ali Jadbabaie
BMCBI
2010
144views more  BMCBI 2010»
13 years 10 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
ICRA
2002
IEEE
97views Robotics» more  ICRA 2002»
14 years 2 months ago
Gripping Parts at Concave Vertices
ct A simple gripper with two vertical cylindrical jaws can make contact with external or internal concavities in polygonal and polyhedral parts to align and grip parts in form clos...
K. Gopalakrishnan 0002, Kenneth Y. Goldberg
COMPGEOM
2007
ACM
14 years 1 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...