Sciweavers

3068 search results - page 432 / 614
» Clustering with Multiple Graphs
Sort
View
SPAA
2003
ACM
15 years 11 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
DDEP
2000
Springer
15 years 11 months ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt
ICSE
2000
IEEE-ACM
15 years 10 months ago
Workshop on standard exchange format (WoSEF)
A workshop was held at ICSE 2000 in Limerick, Ireland to further efforts in the development of a standard exchange format (SEF) for data extracted from and about source code. WoSE...
Susan Elliott Sim, Richard C. Holt, Rainer Koschke
DCOSS
2008
Springer
15 years 8 months ago
On the Deterministic Tracking of Moving Objects with a Binary Sensor Network
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
Yann Busnel, Leonardo Querzoni, Roberto Baldoni, M...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn