Sciweavers

80 search results - page 8 / 16
» A fast cost scaling algorithm for submodular flow
Sort
View
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 13 days ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
TC
2010
13 years 5 months ago
Design and Analysis of On-Chip Networks for Large-Scale Cache Systems
—Switched networks have been adopted in on-chip communication for their scalability and efficient resource sharing. However, using a general network for a specific domain may res...
Yuho Jin, Eun Jung Kim, Ki Hwan Yum
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
14 years 4 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 8 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
ICNP
2002
IEEE
14 years 13 days ago
A Simple and Scalable Fair Bandwidth Sharing Mechanism for Multicast Flows
Despite a decade of research and development, multicast has not yet been deployed on a global scale. Among the difficulties with the current infrastructure are intermulticast fai...
Fethi Filali, Walid Dabbous