Sciweavers

4860 search results - page 415 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
15 years 8 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
ICIP
2000
IEEE
16 years 5 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
ICIP
1995
IEEE
16 years 5 months ago
A multiresolution approach to color image restoration and parameter estimation using homotopy continuation method
In this paper, we address the problem of color image restoration. Here, we model the image as a Markov Random Field (MRF) and propose a restoration algorithm in a multiresolution ...
P. K. Nanda, K. Sunil Kumar, S. Ghokale, Uday B. D...
GLOBECOM
2007
IEEE
15 years 10 months ago
On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
Ashutosh Deepak Gore, Abhay Karandikar, Srikanth J...
CCECE
2006
IEEE
15 years 10 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...