Sciweavers

13591 search results - page 249 / 2719
» On the Implementation of Dynamic Evaluation
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
16 years 26 days ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
COMPGEOM
2006
ACM
16 years 20 days ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
ERLANG
2003
ACM
15 years 12 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
COMPSAC
2002
IEEE
15 years 11 months ago
Design and Implementation of a Network Application Architecture for Thin Clients
This paper explores the issues and the techniques of enabling multimedia applications for the thin client computing. A prototype of a video communication system based on H.323 fam...
Chia-Chen Kuo, Ping Ting, Ming-Syan Chen, Jeng-Chu...
ICPP
1999
IEEE
15 years 11 months ago
A Bandwidth-Efficient Implementation of Mesh with Multiple Broadcasting
This paper presents a mesh with virtual buses as the bandwidth-efficient implementation of the mesh with multiple broadcasting on which many computational problems can be solved w...
Jong Hyuk Choi, Bong Wan Kim, Kyu Ho Park, Kwang-I...