Sciweavers

2228 search results - page 300 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
JNW
2006
145views more  JNW 2006»
13 years 10 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
ICS
2005
Tsinghua U.
14 years 3 months ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
ICMCS
2009
IEEE
219views Multimedia» more  ICMCS 2009»
13 years 8 months ago
Moving targets labeling and correspondence over multi-camera surveillance system based on Markov network
In this paper, we propose an efficient way to simultaneously label and map targets over a multi-camera surveillance system. In the system, we first fuse the detection results from...
Chingchun Huang, Sheng-Jyh Wang
GCC
2007
Springer
14 years 4 months ago
Improving the Performance of MPI Applications over Computational Grid
The Message Passing Interface (MPI) is a standard in parallel computing, and can also be used as a highperformance programming model for Grid application development. How to execu...
Bo Song, Guangwen Yang, Qiming Fang
WINET
2002
128views more  WINET 2002»
13 years 10 months ago
Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks
In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminate information among sensors in ...
Joanna Kulik, Wendi Rabiner Heinzelman, Hari Balak...