Sciweavers

518 search results - page 90 / 104
» Beating a Random Assignment
Sort
View
116
Voted
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 2 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
ICDCS
2008
IEEE
15 years 8 months ago
Correlation-Aware Object Placement for Multi-Object Operations
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
Ming Zhong, Kai Shen, Joel I. Seiferas
P2P
2008
IEEE
124views Communications» more  P2P 2008»
15 years 8 months ago
A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
P2P-TV systems distribute live streaming contents by organizing the information flow in small chunks that are exchanged among peers. Different strategies can be implemented at th...
Ana Paula Couto da Silva, Emilio Leonardi, Marco M...
GLOBECOM
2007
IEEE
15 years 8 months ago
Beamforming with Limited Feedback in Amplify-and-Forward Cooperative Networks
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
Yi Zhao, Raviraj Adve, Teng Joon Lim
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 8 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci