Sciweavers

6568 search results - page 281 / 1314
» Reducing the Complexity of Reductions
Sort
View
ICML
2001
IEEE
16 years 7 months ago
Inducing Partially-Defined Instances with Evolutionary Algorithms
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instance...
Josep Maria Garrell i Guiu, Xavier Llorà
ISLPED
2000
ACM
111views Hardware» more  ISLPED 2000»
15 years 11 months ago
Low power techniques and design tradeoffs in adaptive FIR filtering for PRML read channels
In this paper, we describe area and power reduction techniques for a low-latency adaptive finite-impulse response filter for magnetic recording read channel applications. Variou...
Khurram Muhammad, Robert B. Staszewski, Poras T. B...
VISUALIZATION
1997
IEEE
15 years 11 months ago
A topology modifying progressive decimation algorithm
Triangle decimation techniques reduce the number of triangles in a mesh, typically to improve interactive rendering performance or reduce data storage and transmission requirement...
William J. Schroeder
IJCAI
2003
15 years 8 months ago
Efficient Symmetry Breaking for Boolean Satisfiability
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov
ICCAD
2002
IEEE
113views Hardware» more  ICCAD 2002»
16 years 3 months ago
Interconnect-aware high-level synthesis for low power
Abstract—Interconnects (wires, buffers, clock distribution networks, multiplexers and busses) consume a significant fraction of total circuit power. In this work, we demonstrat...
Lin Zhong, Niraj K. Jha