Sciweavers

1486 search results - page 113 / 298
» Algorithms for two-box covering
Sort
View
125
Voted
ACSC
2007
IEEE
15 years 10 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka
160
Voted
SIGMOD
1999
ACM
143views Database» more  SIGMOD 1999»
15 years 8 months ago
WALRUS: A Similarity Retrieval Algorithm for Image Databases
Traditional approaches for content-based image querying typically compute a single signature for each image based on color histograms, texture, wavelet transforms etc., and return...
Apostol Natsev, Rajeev Rastogi, Kyuseok Shim
CEC
2007
IEEE
15 years 8 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
ALGOSENSORS
2006
Springer
15 years 7 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
ER
2006
Springer
112views Database» more  ER 2006»
15 years 7 months ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser