Sciweavers

288 search results - page 45 / 58
» On the number of maximal independent sets in a graph
Sort
View
GLOBECOM
2007
IEEE
15 years 4 months ago
A Cluster-Based Multiuser Cooperative Network
Abstract— A novel cluster-based coherent multi-user (MU) relaying system is proposed, where a number of source/destination pairs communicate concurrently over the same physical c...
Celal Esli, Armin Wittneben
IEEESCC
2009
IEEE
14 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 1 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
CGF
2005
111views more  CGF 2005»
14 years 9 months ago
Hierarchyless Simplification, Stripification and Compression of Triangulated Two Manifolds
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...
Pablo Diaz-Gutierrez, Meenakshisundaram Gopi, Rena...
NETWORKS
2007
14 years 9 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu