Sciweavers

13214 search results - page 2379 / 2643
» Pseudorandomness for network algorithms
Sort
View
ASPLOS
2004
ACM
16 years 4 days ago
FAB: building distributed enterprise disk arrays from commodity components
This paper describes the design, implementation, and evaluation of a Federated Array of Bricks (FAB), a distributed disk array that provides the reliability of traditional enterpr...
Yasushi Saito, Svend Frølund, Alistair C. V...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
16 years 2 days ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
146
Voted
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
16 years 2 days ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
LCN
2003
IEEE
15 years 12 months ago
Improving the Aggregate Throughput of Access Points in IEEE 802.11 Wireless LANs
In IEEE 802.11 wireless LANs, the DCF access method and the PCF access method operate alternatively within a superframe to service the time-varying traffic demands. Due to differ...
X. James Dong, Mustafa Ergen, Pravin Varaiya, Anuj...
169
Voted
FPGA
2003
ACM
137views FPGA» more  FPGA 2003»
15 years 12 months ago
Customized regular channel design in FPGAs
FPGAs are one of the essential components in platform-based embedded systems. Such systems are customized and applied only to a limited set of applications. Also some applications...
Elaheh Bozorgzadeh, Majid Sarrafzadeh
« Prev « First page 2379 / 2643 Last » Next »