Auffray, C, Rocke, D, Delavi, D, Dubhashi, D, ...
Bridging the gap between systems biology and medicine (2009)
Auufray, C, Rocke, D.M, Dalevi, D, Dubhashi, D, ...
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs \Lambda (2008)
Extended Abstract, E. Caceres, A. Chan, F. Dehne, G. Prencipe
Abstract In this paper, we present parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel computer (BSP) for solving two well known graph problems: (1)...
Ftce Universidade Ao, Judas Tadeu, E. N. Cáceres, F. Dehne
paper we prER9 t a coar6E grE$ ed parRXEA algor7 hm for solving the str ng edit distance p r blem for a str ng A and all substr ings of a str ing C.
Pitre, S., North, C., Alamgir, M., Jessulat, M., Chan, A., Luo, X., ...
Protein–protein interaction (PPI) maps provide insight into cellular biology and have received considerable attention in the post-genomic era. While large-scale experimental approaches have...
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP (2007)
Extend Ed, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, ...
E. C'aceres 1 , F. Dehne 2 , A. Ferreira 3 , P. Flocchini 4 , I. Rieping 5 , A. Roncato 6 , N. Santoro 7 , and S. W. Song 8 1 Univ. Federal de Mato Grosso do Sul, Campo Grande, Brasil,...
F. Dehne, X. Deng, P. Dymond, A. Fabri, A. A. Khokhar
Abstract. We present a randomized parallel algorithm for constructing the threedimensional convex hull on a generic p-processor coarse-grained multicomputer with arbitrary interconnection network and...
F. Dehne, A. Ferreira, E. Cáceres, S. W. Song, A. Roncato
Abstract. In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph...
Universidade Federal de Mato (2007)
Judas Tadeu, Grosso Do Sul, Campo Gr, Ms Brazil, ...
In this paper we present a coarse-grained parallel algorithm for solving the string edit distance problem for a string A and all substrings of a string C. Our method is based on a novel CGM/BSP...
E. N. Caceres, F. Dehne, S. W. Song
Abstract. We present a CGM/BSP algorithm for computing an alignment (or string editing) between two strings A and C, with jAj = m and jCj = n. The algorithm requires O(p) communication rounds and O(...
Universidade Federal de Mato Grosso do Sul (2007)
Judas Tadeu, F. Dehne, S. W. Song
In this paper we extend and improve a previous result for computing an alignment (or string editing) between two strings A and C, with jAj = m and jCj = n, which requires O(p) communication rounds...
E. N. Caceres, F. Dehne, S. W. Song, S~ao Judas Tadeu, Sp Brazil
Abstract. We present a CGM/BSP algorithm for computing an alignment (or string editing) between two strings A and C, with jAj = m and jCj = n. The algorithm requires O(p) communication rounds and O(...
F. Dehne, B. Flach, N. Valiveti
We introduce a novel approach to Parallel Computational Geometry by using networks of analog components, referred to as analog networks or analog circuits. The analog network we study here is the...
MESH SIMPLIFICATION IN PARALLEL (2007)
Council Canada, C. Langis, G. Roth, F. Dehne, Christian Langis, Gerhard Roth, ...
de l’information
Chapter 26 A NOTE ON COARSE GRAINED PARALLEL INTEGER SORTING (2007)
Abstract We observe that for n=p p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication...
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components ⋆ (2007)
E. N. Cáceres, F. Dehne, H. Mongelli, S. W. Song, J. L. Szwarcfiter
Abstract. Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM algorithm...
Parallel Dynamic Programming for Solving the String (2007)
Editing Problem On, Judas Tadeu, Grosso Do Sul, Campo Gr, Ms Brazil, ...
In this paper we present a coarse-grained parallel algorithm for solving the string edit distance problem for a string A and all substrings of a string C. Our method is based on a novel CGM/BSP...
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes (2006)
Y. Chen, A. Rau-Chaplin, F. Dehne, T. Eavis, D. Green, E. Sithirasenan
We present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporates a variety of novel approaches...
The cgmCUBE project: Optimizing parallel data cube generation for ROLAP (2006)
Frank Dehne, Todd Eavis, Andrew Rau-chaplin, F. Dehne, T. Eavis
On-line Analytical Processing (OLAP) has become one of the most powerful and prominent technologies for knowledge discovery in VLDB (Very Large Database) environments. Central to the OLAP paradigm is...
cgmOLAP: Efficient Parallel Generation and (2006)
Querying Of Terabyte, Y. Chen, F. Dehne, T. Eavis, D. Green, E. Sithirasenan
We present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporates a variety of novel approaches...
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem (2005)
Dehne, F., Langston, M.A., Stevens, K.
We describe an algorithm for the FEEDBACK VERTEX SET problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the...
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem (2005)
Dehne, F., Fellows, Michael, Rosamond, F., Langston, M.A., Stevens, K.
We describe an algorithm for the FEEDBACK VERTEX SET problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the...
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem (2005)
Dehne, F., Fellows, Michael, Rosamond, F., Langston, M.A., Stevens, K.
We describe an algorithm for the FEEDBACK VERTEX SET problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the...
Refined memorisation for vertex cover (2004)
Chandran, L. Sunil, Grandoni, Fabrizio, Dehne, F., Downey, R., Fellows, M.
A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison (2003)
E.N. Cáceres, F. Dehne, S.W. Song, São Paulo
In this paper we present a parallel wavefront algorithm for computing an alignment between two strings A and C, with |A| = m, and |C| = n. On a distributed memory parallel computer of p processors...
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components (2003)
E. N. Caceres, F. Dehne, H. Mongelli, S. W. Song, J. L. Szwarcfiter
Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p) communication rounds, where p is the number of processors. It...
A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison (2003)
E. N. Cáceres, F. Dehne, S. W. Song, São Paulo
Abstract. In this paper we present a parallel wavefront algorithm for computing an alignment between two strings A and C, with |A | = m and |C | = n. On a distributed memory parallel computer of p...
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs (2000)
E. Caceres, A. Chan, F. Dehne, G. Prencipe
Abstract. In this paper, we present parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel computer (BSP) for solving twowell known graph problems: (1)...
MESH SIMPLIFICATION IN PARALLEL (2000)
Council Canada, C. Langis, G. Roth, F. Dehne, Christian Langis, Gerhard Roth, ...
de l’information
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs (2000)
E. Caceres, A. Chan, F. Dehne, G. Prencipe
In this paper, we present parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel computer (BSP) for solving two well known graph problems: (1) determining...
A note on coarse grained parallel integer sorting (1999)
Abstract We observe that for n=p p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting-relations and 18 p-relations),...
Parallel virtual memory (1999)
F. Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari
Parallel algorithms for the Bulk Synchronous Parallel (BSP) and closely related Coarse Gained Multicomputer (CGM) programming model assume that all data can be distributed over the main memories of...
Parallel virtual memory (1999)
F. Dehne, Iv. Dittricht, D. Hutchinson, A. Maheshwari
Parallel algorithms for the Bulk Synchronous Parallel (BSP) and closely related Coarse Gained Multicomputer (CGM) programming model assume that all data can be distributed over the main memories of...
Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM (1998)
V. Alexandrov, F. Dehne, A. Rau-chaplin, K. Taft
The problem of solving System of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered.
Parallel Virtual Memory (1998)
Dehne Dittrich Hutchinson, F. Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari
parallel disks connected to p 1 processors which communicate via a shared internal memory or a network. The PDM uses the following additional parameters: N = problem size, M = internal memory size, B...
A Note on Coarse Grained Parallel Integer Sorting (1998)
We observe that for n/p # p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds...
E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, ...
In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CGM) and bulk-synchronous parallel computer (BSP) models which solve the following well known graph...
E cient parallel graph algorithms for coarse grained multicomputers and BSP (1997)
F. Dehne, A. Ferreira, E. Caceres, S. W. Song, A. Roncato
In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well known graph problems:...
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams (1997)
We show that the wavefront approach to Voronoi diagrams (a deterministic line-sweep algorithm that does not use geometric transform) can be generalized to distance measures more general than the...
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP (1997)
Extend Ed, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, ...
E. C'aceres 1 , F. Dehne 2 , A. Ferreira 3 , P. Flocchini 4 , I. Rieping 5 , A. Roncato 6 , N. Santoro 7 , and S. W. Song 8 1 Univ. Federal de Mato Grosso do Sul, Campo Grande, Brasil,...
Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP (1997)
E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, ...
In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well known graph problems:...
E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, ...
E. C'aceres 1 , F. Dehne 2 , A. Ferreira 3 , P. Flocchini 4 , I. Rieping 5 , A. Roncato 6 , N. Santoro 7 , and S. W. Song 8 1 Univ. Federal de Mato Grosso do Sul, Campo Grande, Brasil,...
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers (1994)
M. J. Atallah, F. Dehne, R. Miller, A. Rau-Chaplin
The {\em multisearch problem} is defined as follows. Given a data structure $D$ modeled as a graph with $n$ constant-degree nodes, perform $O(n)$ searches on $D$. Let $r$ be the length of the longest...
An Efficient Computational Geometry Method for Detecting Dotted Lines in Noisy Images (1990)
In this paper we present an efficient O(n log n) time, linear space, algorithm for detecting a line, or line segment, represented by a set of nL collinear points contained in a rectangular window...
Pitre, S., North, C., Alamgir, M., Jessulat, M., Chan, A., Luo, X., ...
Protein–protein interaction (PPI) maps provide insight into cellular biology and have received considerable attention in the post-genomic era. While large-scale experimental approaches have...