10608 search results - page 1633 / 2122 » Complexity of O'Hara's Algorithm |
214
Voted
TIFS
2008
15 years 7 months ago
2008
This paper presents two vector watermarking schemes that are based on the use of complex and quaternion Fourier transforms and demonstrates, for the first time, how to embed waterm...
228
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Systematic evaluation and study of single nucleotide polymorphisms (SNPs) made possible by high throughput genotyping technologies and bioinformatics promises to provi...
212
click to vote
JACM
2000
15 years 7 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
202
click to vote
IJIS
2002
15 years 7 months ago
2002
ior-based robots, planning is necessary to elaborate abstract plans that resolve complex navigational tasks. Usually maps of the environment are used to plan the robot motion and t...
182
click to vote
EXPERT
1998
15 years 7 months ago
1998
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...