Sciweavers

983 search results - page 72 / 197
» Circuit Complexity and Multiplicative Complexity of Boolean ...
Sort
View
INTERACTION
2009
ACM
14 years 4 months ago
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Selim Mimaroglu, A. Murat Yagci
ISQED
2006
IEEE
107views Hardware» more  ISQED 2006»
14 years 4 months ago
On Optimizing Scan Testing Power and Routing Cost in Scan Chain Design
— With advanced VLSI manufacturing technology in deep submicron (DSM) regime, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC desi...
Li-Chung Hsu, Hung-Ming Chen
ICIP
2006
IEEE
14 years 12 months ago
Supershape Recovery from 3D Data Sets
In this paper, we apply supershapes and R-functions to surface recovery from 3D data sets. Individual supershapes are separately recovered from a segmented mesh. R-functions are u...
Andrei V. Gribok, Frédéric Truchetet...
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
IJNM
2000
91views more  IJNM 2000»
13 years 10 months ago
Coding-based schemes for fault identification in communication networks
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly difficult. Since faults ...
Chi-Chun Lo, Shing Hong Chen, Bon-Yeh Lin