6598 search results - page 1063 / 1320 » Graph Theory with Applications |
191
click to vote
IEEECGIV
2009
IEEE
15 years 4 months ago
2009
IEEE
Effective and efficient navigation and representation of the entire structure of the product catalogue is one of the important factors for on-line market. This paper proposes an a...
223
click to vote
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
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...
193
click to vote
IFIPTM
2009
15 years 4 months ago
2009
In many distributed applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the part...
158
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
196
click to vote
CPC
2010
15 years 4 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...