Sciweavers

2173 search results - page 206 / 435
» On the Values of Reducibility Candidates
Sort
View
MICRO
1997
IEEE
86views Hardware» more  MICRO 1997»
15 years 10 months ago
Streamlining Inter-Operation Memory Communication via Data Dependence Prediction
We revisit memory hierarchy design viewing memory as an inter-operation communication agent. This perspective leads to the development of novel methods of performing inter-operati...
Andreas Moshovos, Gurindar S. Sohi
DICTA
2003
15 years 8 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
ICDE
2009
IEEE
223views Database» more  ICDE 2009»
16 years 8 months ago
Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks
Abstract-- Recent work has demonstrated that readings provided by commodity sensor nodes are often of poor quality. In order to provide a valuable sensory infrastructure for monito...
Antonios Deligiannakis, Yannis Kotidis, Vasilis Va...
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
16 years 7 months ago
Address Code and Arithmetic Optimizations for Embedded Systems
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
J. Ramanujam, Satish Krishnamurthy, Jinpyo Hong, M...
WIMOB
2008
IEEE
16 years 28 days ago
A Moderate to Robust Game Theoretical Model for Intrusion Detection in MANETs
—One popular solution for reducing the resource consumption of Intrusion Detection System (IDS) in MANET is to elect a head-cluster (leader) to provide intrusion detection servic...
Hadi Otrok, Noman Mohammed, Lingyu Wang, Mourad De...