Sciweavers

6388 search results - page 1083 / 1278
» High Performance Data Mining
Sort
View
ICS
2009
Tsinghua U.
15 years 3 months ago
Refereeing conflicts in hardware transactional memory
In the search for high performance, most transactional memory (TM) systems execute atomic blocks concurrently and must thus be prepared for data conflicts. The TM system must then...
Arrvindh Shriraman, Sandhya Dwarkadas
DAC
2005
ACM
16 years 7 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim
VLDB
2007
ACM
122views Database» more  VLDB 2007»
16 years 6 months ago
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
ICC
2007
IEEE
124views Communications» more  ICC 2007»
16 years 12 days ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy
CF
2006
ACM
16 years 2 days ago
Exploiting locality to ameliorate packet queue contention and serialization
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
Sailesh Kumar, John Maschmeyer, Patrick Crowley
« Prev « First page 1083 / 1278 Last » Next »