Sciweavers

882 search results - page 75 / 177
» On self-embeddings of computable linear orderings
Sort
View
TCAD
2008
106views more  TCAD 2008»
14 years 9 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
PR
2000
106views more  PR 2000»
14 years 9 months ago
Non-linear image processing in hardware
A new ASIC capable of computing rank order "lters, weighted rank order "lters, standard erosion and dilation, soft erosion and dilation, order statistic soft erosion and...
Antonios Gasteratos, Ioannis Andreadis
JSYML
2007
100views more  JSYML 2007»
14 years 9 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
PODC
2006
ACM
15 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
TNN
1998
254views more  TNN 1998»
14 years 9 months ago
Periodic symmetric functions, serial addition, and multiplication with neural networks
Abstract—This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable perio...
Sorin Cotofana, Stamatis Vassiliadis