Sciweavers

103 search results - page 9 / 21
» Hierarchical Design of Fast Minimum Disagreement Algorithms
Sort
View
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 4 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
MM
2010
ACM
238views Multimedia» more  MM 2010»
13 years 7 months ago
Vlfeat: an open and portable library of computer vision algorithms
VLFeat is an open and portable library of computer vision algorithms. It aims at facilitating fast prototyping and reproducible research for computer vision scientists and student...
Andrea Vedaldi, Brian Fulkerson
CAISE
2006
Springer
13 years 11 months ago
A Tool for Semi-Automated Semantic Schema Mapping: Design and Implementation
Recently, schema mapping has found considerable interest in both research and practice. Determining matching components of database or XML schemas is needed in many applications, e...
Dimitris Manakanatas, Dimitris Plexousakis
CLUSTER
2000
IEEE
14 years 1 days ago
Contention-free Complete Exchange Algorithm on Clusters
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
Anthony T. C. Tam, Cho-Li Wang
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 4 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh