Sciweavers

4009 search results - page 798 / 802
» Clustering on Complex Graphs
Sort
View
TCAD
1998
114views more  TCAD 1998»
13 years 7 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
SOSYM
2002
188views more  SOSYM 2002»
13 years 7 months ago
Extending the Unified Modeling Language for ontology development
Abstract. There is rapidly growing momentum for web enabled agents that reason about and dynamically integrate the appropriate knowledge and services at run-time. The dynamic integ...
Kenneth Baclawski, Mieczyslaw M. Kokar, Paul A. Ko...
TON
2002
144views more  TON 2002»
13 years 7 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
TROB
2002
138views more  TROB 2002»
13 years 7 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
IJON
2010
178views more  IJON 2010»
13 years 5 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen