Sciweavers

5005 search results - page 496 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
15 years 11 months ago
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
Jesús Cerquides, Ramon López de M&aa...
DAC
2001
ACM
16 years 7 months ago
High-Quality Operation Binding for Clustered VLIW Datapaths
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
DAC
2003
ACM
16 years 7 months ago
Optimizations for a simulator construction system supporting reusable components
Exploring a large portion of the microprocessor design space requires the rapid development of efficient simulators. While some systems support rapid model development through the...
David A. Penry, David I. August
ISQED
2006
IEEE
94views Hardware» more  ISQED 2006»
16 years 27 days ago
System-Level SRAM Yield Enhancement
It is well known that SRAM constitutes a large portion of modern integrated circuits, with 80% or more of the total transistors being dedicated to SRAM in a typical processor or S...
Fadi J. Kurdahi, Ahmed M. Eltawil, Young-Hwan Park...
INFOCOM
2005
IEEE
16 years 14 days ago
On neighbor discovery in wireless networks with directional antennas
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform rand...
Sudarshan Vasudevan, James F. Kurose, Donald F. To...