Sciweavers

1243 search results - page 141 / 249
» Complexity reduction of C-Algorithm
Sort
View
ISLPED
1998
ACM
78views Hardware» more  ISLPED 1998»
15 years 5 months ago
Power-delay tradeoffs for radix-4 and radix-8 dividers
The use of higher radices in division reduces the number of iterations to complete the operation, but increases the complexity of the circuit. In this paper we explore the in uenc...
Alberto Nannarelli, Tomás Lang
ISPD
1998
ACM
111views Hardware» more  ISPD 1998»
15 years 5 months ago
A pattern matching algorithm for verification and analysis of very large IC layouts
We propose a simple, isometry invariant pattern matching algorithm for an effective data reduction useful in layout-related data processing of very complex IC designs. The repeata...
Mariusz Niewczas, Wojciech Maly, Andrzej J. Strojw...
CG
1998
Springer
15 years 5 months ago
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
Andreas Junghanns, Jonathan Schaeffer
HICSS
1996
IEEE
139views Biometrics» more  HICSS 1996»
15 years 5 months ago
Strictly Class-Based Modeling Considered Harmful
Many object-oriented methods have assumed classbased approaches, without considering prototype-based ones. Some authors, while admitting prototypes as a useful concept, only envis...
Birgitte Krogh, Sean Levy, Allen H. Dutoit, Eswara...
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 5 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...