Sciweavers

197 search results - page 29 / 40
» Some Topological Methods in Graph Coloring Theory
Sort
View
ECUMN
2007
Springer
14 years 2 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson
ICFCA
2004
Springer
14 years 1 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
BMCBI
2005
137views more  BMCBI 2005»
13 years 8 months ago
A configuration space of homologous proteins conserving mutual information and allowing a phylogeny inference based on pair-wise
Background: Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topo...
Olivier Bastien, Philippe Ortet, Sylvaine Roy, Eri...
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
13 years 3 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 2 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad