Sciweavers

10106 search results - page 1720 / 2022
» Algorithm Selection and Scheduling
Sort
View
CGF
2004
86views more  CGF 2004»
15 years 6 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek
BMCBI
2002
136views more  BMCBI 2002»
15 years 6 months ago
Making sense of EST sequences by CLOBBing them
Background: Expressed sequence tags (ESTs) are single pass reads from randomly selected cDNA clones. They provide a highly cost-effective method to access and identify expressed g...
John Parkinson, David B. Guiliano, Mark L. Blaxter
JNSM
2002
218views more  JNSM 2002»
15 years 6 months ago
An Agent-based Connection Management Protocol for Ad Hoc Wireless Networks
Realizing high volume of data transmission in real time communication in a highly dynamic architecture like Mobile Ad hoc Networks (MANET) still remains a major point of research....
Romit Roy Choudhury, Krishna Paul, Somprakash Band...
TKDE
1998
122views more  TKDE 1998»
15 years 6 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
TON
2002
99views more  TON 2002»
15 years 6 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
« Prev « First page 1720 / 2022 Last » Next »