Sciweavers

1461 search results - page 139 / 293
» Complexity of Graph Covering Problems
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 10 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
TMC
2008
127views more  TMC 2008»
14 years 10 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
IJCAI
2001
14 years 11 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
IPPS
2000
IEEE
15 years 1 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
BMCBI
2010
189views more  BMCBI 2010»
14 years 10 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...