Sciweavers

354 search results - page 42 / 71
» Sorting networks on FPGAs
Sort
View
ESOA
2006
14 years 2 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
LCR
2000
Springer
172views System Software» more  LCR 2000»
14 years 2 months ago
Achieving Robust, Scalable Cluster I/O in Java
We present Tigris, a high-performance computation and I/O substrate for clusters of workstations that is implemented entirely in Java. Tigris automatically balances resource load a...
Matt Welsh, David E. Culler
COR
2007
99views more  COR 2007»
13 years 11 months ago
An improved algorithm for the p-center problem on interval graphs with unit lengths
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
T. C. Edwin Cheng, Liying Kang, C. T. Ng
JSAC
2006
147views more  JSAC 2006»
13 years 11 months ago
Smart pay access control via incentive alignment
We use game theorectic models to show the lack of incentives in the TCP congestion avoidance algorithm and the consequential systemwide network problems. We then propose a Vickery-...
Jun Shu, Pravin Varaiya
ARCS
2009
Springer
14 years 5 months ago
Ultra-Fast Downloading of Partial Bitstreams through Ethernet
Abstract. In this paper we present a partial bitstreams ultra-fast downloading process through a standard Ethernet network. These Virtex-based and partially reconfigurable systems...
Pierre Bomel, Jeremie Crenne, Linfeng Ye, Jean-Phi...