Sciweavers

5889 search results - page 466 / 1178
» Graph Layout Problems
Sort
View
COCOON
2008
Springer
15 years 9 months ago
Visual Cryptography on Graphs
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
Steve Lu, Daniel Manchala, Rafail Ostrovsky
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 7 months ago
Context Awareness Framework Based on Contextual Graph
- Nowadays computing becomes increasingly mobile and pervasive. One of the important steps in pervasive computing is context-awareness. Context-aware pervasive systems rely on info...
Tam Van Nguyen, Wontaek Lim, Huy Anh Nguyen, Deokj...
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 7 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 4 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
DAC
2005
ACM
16 years 8 months ago
Minimising buffer requirements of synchronous dataflow graphs with model checking
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
Marc Geilen, Twan Basten, Sander Stuijk