Sciweavers

5493 search results - page 24 / 1099
» Effectively Polynomial Simulations
Sort
View
PVLDB
2010
129views more  PVLDB 2010»
14 years 10 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
DATE
2002
IEEE
87views Hardware» more  DATE 2002»
15 years 4 months ago
Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
Yiran Chen, Venkataramanan Balakrishnan, Cheng-Kok...
ICC
2009
IEEE
190views Communications» more  ICC 2009»
15 years 6 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
ASPDAC
2007
ACM
108views Hardware» more  ASPDAC 2007»
15 years 3 months ago
Reduced-Order Wide-Band Interconnect Model Realization using Filter-Based Spline Interpolation
In the paper, we develop a systematic methodology for modeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolatio...
Arthur Nieuwoudt, Mehboob Alam, Yehia Massoud
ICRA
2003
IEEE
128views Robotics» more  ICRA 2003»
15 years 5 months ago
Avoiding unsafe states in manufacturing systems based on polynomial digraph algorithms
Abstract − A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in ma...
Yin Wang, Zhiming Wu