Sciweavers

1802 search results - page 231 / 361
» Complexity Theory for Operators in Analysis
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
ICS
2007
Tsinghua U.
16 years 16 days ago
Adaptive Strassen's matrix multiplication
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
Paolo D'Alberto, Alexandru Nicolau
ECIS
2003
15 years 7 months ago
Emerging organisations: metateams in major IT projects
During the last decade, teams working on information technology (IT) development and implementation projects have experienced significant transformations. Nowadays, many members o...
Walter D. Fernández, Alan Underwood
TNN
2010
234views Management» more  TNN 2010»
15 years 1 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
EDOC
2007
IEEE
16 years 22 days ago
An Enterprise Architecture Alignment Measure for Telecom Service Development
The increasing complexity of modern Information Services (IS) makes necessary to carry on review activities. For many companies, these reviews take place within the framework of t...
Jacques Simonin, Yves Le Traon, Jean-Marc Jé...