Sciweavers

220 search results - page 29 / 44
» Reconstruction Algorithm for Permutation Graphs
Sort
View
IPPS
1999
IEEE
13 years 12 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
14 years 2 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
ICIP
2003
IEEE
14 years 9 months ago
Detection and extraction of road networks from high resolution satellite images
This article addresses the problem of road extraction from new high resolution satellite images. The proposed algorithm is divided in two sequential modules : a topologically corr...
Renaud Péteri, Julien Celle, Thierry Ranchi...
COMPGEOM
2006
ACM
14 years 1 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...