Sciweavers

6409 search results - page 74 / 1282
» A Computational Algorithm for Origami Design
Sort
View
IDEAL
2003
Springer
15 years 6 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
ISCAS
2007
IEEE
121views Hardware» more  ISCAS 2007»
15 years 7 months ago
Topological Placement with Multiple Symmetry Groups of Devices for Analog Layout Design
Abstract– This paper presents an improved topological algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible sequen...
Karthik Krishnamoorthy, Sarat C. Maruvada, Florin ...
BIRTHDAY
2012
Springer
13 years 9 months ago
Operand Folding Hardware Multipliers
This paper describes a new accumulate-and-add multiplication algorithm. The method partitions one of the operands and re-combines the results of computations done with each of the ...
Byungchun Chung, Sandra Marcello, Amir-Pasha Mirba...
SIGCSE
2004
ACM
96views Education» more  SIGCSE 2004»
15 years 7 months ago
Teaching computation to undergraduate scientists
This paper describes the motivation and design of an introductory computational course for natural, physical, and social scientists. Categories and Subject Descriptors: K.3.2 Comp...
Daniel T. Kaplan
CASES
2006
ACM
15 years 7 months ago
Scalable subgraph mapping for acyclic computation accelerators
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
Nathan Clark, Amir Hormati, Scott A. Mahlke, Sami ...