Sciweavers

2434 search results - page 448 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
COCOON
2007
Springer
15 years 6 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
121
Voted
IWSEC
2007
Springer
15 years 6 months ago
Privacy-Preserving Eigentaste-Based Collaborative Filtering
With the evolution of e-commerce, privacy is becoming a major concern. Many e-companies employ collaborative filtering (CF) techniques to increase their sales by providing truthfu...
Ibrahim Yakut, Huseyin Polat
ATAL
2003
Springer
15 years 5 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
110
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
108
Voted
BMCBI
2007
166views more  BMCBI 2007»
15 years 16 days ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...