Sciweavers

413 search results - page 7 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
DAC
1994
ACM
15 years 10 months ago
Minimal Delay Interconnect Design Using Alphabetic Trees
Abstract - We propose a new algorithm for the performancedriven interconnect design problem, based on alphabetic trees. The interconnect topology is determined in a global manner a...
Ashok Vittal, Malgorzata Marek-Sadowska
SLIP
2009
ACM
16 years 11 days ago
Predicting the worst-case voltage violation in a 3D power network
This paper proposes an efficient method to predict the worst case of voltage violation by multi-domain clock gating in a three-dimensional (3D) on-chip power network considering l...
Wanping Zhang, Wenjian Yu, Xiang Hu, Amirali Shaya...
137
Voted
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
15 years 7 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
CORR
2011
Springer
210views Education» more  CORR 2011»
15 years 26 days ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro
ACL
2009
15 years 3 months ago
A Syntax-Free Approach to Japanese Sentence Compression
Conventional sentence compression methods employ a syntactic parser to compress a sentence without changing its meaning. However, the reference compressions made by humans do not ...
Tsutomu Hirao, Jun Suzuki, Hideki Isozaki