Sciweavers

1830 search results - page 166 / 366
» Workshop on Graph Computation Models
Sort
View
CAD
2002
Springer
15 years 4 months ago
Surface flattening based on energy model
This paper presents a method for three-dimensional surface flattening, which can be efficiently used in threedimensional computer aided garment design. First, facet model is used ...
Charlie C. L. Wang, Shana S.-F. Smith, Matthew Min...
FCS
2009
15 years 2 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
MOBICOM
2006
ACM
15 years 11 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
WADS
2009
Springer
262views Algorithms» more  WADS 2009»
15 years 11 months ago
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
Chenyu Yan, Yang Xiang, Feodor F. Dragan
HICSS
2008
IEEE
135views Biometrics» more  HICSS 2008»
15 years 11 months ago
Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation
While executing a process, many decisions are taken at its various decision points for selecting paths. There is a need for understanding and analyzing on various paths that emana...
Sinnakkrishnan Perumal, Ambuj Mahanti