Sciweavers

138 search results - page 17 / 28
» Clustering Cycles into Cycles of Clusters
Sort
View
MP
1998
117views more  MP 1998»
13 years 7 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
CLUSTER
2003
IEEE
14 years 1 months ago
Compiler Optimized Remote Method Invocation
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
Ronald Veldema, Michael Philippsen
BMCBI
2008
202views more  BMCBI 2008»
13 years 8 months ago
Network motif-based identification of transcription factor-target gene relationships by integrating multi-source biological data
Background: Integrating data from multiple global assays and curated databases is essential to understand the spatiotemporal interactions within cells. Different experiments measu...
Yuji Zhang, Jianhua Xuan, Benildo de los Reyes, Ro...
CCGRID
2007
IEEE
14 years 2 months ago
Design and Implementation of a Middleware for Data Storage in Opportunistic Grids
Shared machines in opportunistic grids typically have large quantities of unused disk space. These resources could be used to store application and checkpointing data when the mac...
Raphael Y. de Camargo, Fabio Kon
ICCV
2007
IEEE
14 years 2 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers