Sciweavers

1320 search results - page 190 / 264
» Performance Comparison of Distributed Object Server Implemen...
Sort
View
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
14 years 9 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen
LCPC
2007
Springer
14 years 2 months ago
Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
Ronald Veldema, Michael Philippsen
COMPSAC
1998
IEEE
14 years 28 days ago
M-base: Enduser-Initiative Application Development Based on Message Flow and Componentware
Explosive increase in enduser computing on distributed systems requires that endusers develop application software by themselves. One solution is given as a formula of "a dom...
Takeshi Chusho, Mitsuyoshi Matsumoto, Yuji Konishi
DCOSS
2006
Springer
14 years 10 days ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
ICDCS
2009
IEEE
14 years 5 months ago
Pushing the Envelope: Extreme Network Coding on the GPU
While it is well known that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its high compu...
Hassan Shojania, Baochun Li