Sciweavers

10608 search results - page 359 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
119
Voted
ISCAPDCS
2007
15 years 2 months ago
Distributed algorithms for dynamic coverage in sensor networks
The coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks ma...
Lan Lin, Hyunyoung Lee
97
Voted
FCS
2006
15 years 2 months ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems
METMBS
2004
162views Mathematics» more  METMBS 2004»
15 years 2 months ago
A Comparison of DNA Fragment Assembly Algorithms
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
Lishan Li, Sami Khuri
71
Voted
MVA
1994
106views Computer Vision» more  MVA 1994»
15 years 2 months ago
Machine Vision Algorithms on a Color Blindness Plate
This paper presents a new approach including passive and actriveprocesses to deal with the image segmentation and pattern recognition to a color blindness plate (CBP). The CBP is ...
Yung-Sheng Chen, Yu-Chang Hsu
88
Voted
FSTTCS
2008
Springer
15 years 1 months ago
Some Sieving Algorithms for Lattice Problems
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
Vikraman Arvind, Pushkar S. Joglekar