Sciweavers

2104 search results - page 201 / 421
» Sorting with networks of data structures
Sort
View
147
Voted
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 5 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
DAC
2004
ACM
16 years 6 months ago
An efficient scalable and flexible data transfer architecture for multiprocessor SoC with massive distributed memory
Massive data transfer encountered in emerging multimedia embedded applications requires architecture allowing both highly distributed memory structure and multiprocessor computati...
Sang-Il Han, Amer Baghdadi, Marius Bonaciu, Soo-Ik...
INFOCOM
2008
IEEE
15 years 11 months ago
Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks
—The design of computer and communication systems has been based, for decades, on the fundamental assumption that the objective of all users is to improve their own performance. ...
Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy
147
Voted
WWW
2008
ACM
16 years 5 months ago
A semantic layer for publishing and localizing xml data for a p2p xquery mediator
In this poster, we present the P2P XML data localization layer of XLive, an XQuery mediation system developed at University of Versailles [2]. A major challenge in the evaluation ...
Florin Dragan, Georges Gardarin, Laurent Yeh
IPPS
2007
IEEE
15 years 11 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu