Sciweavers

1399 search results - page 265 / 280
» Multi-party Finite Computations
Sort
View
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 9 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
WISES
2003
13 years 8 months ago
Locating Moving Objects over Mobile Sensor Network
The purpose of our on going research would be to track entities, which enter their field of vision over the sensor network. Based on their sightings, they maintain a dynamic cache ...
Arvind Nath Rapaka, Sandeep Bogollu, Donald C. Wun...
ADHOCNOW
2009
Springer
13 years 8 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
BMCBI
2007
139views more  BMCBI 2007»
13 years 7 months ago
XSTREAM: A practical algorithm for identification and architecture modeling of tandem repeats in protein sequences
Background: Biological sequence repeats arranged in tandem patterns are widespread in DNA and proteins. While many software tools have been designed to detect DNA tandem repeats (...
Aaron M. Newman, James B. Cooper