Sciweavers

518 search results - page 76 / 104
» Beating a Random Assignment
Sort
View
COLT
2003
Springer
15 years 7 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
133
Voted
CSB
2002
IEEE
230views Bioinformatics» more  CSB 2002»
15 years 7 months ago
Prediction of Protein Function Using Protein-Protein Interaction Data
Assigning functions to novel proteins is one of the most important problems in the post-genomic era. Several approaches have been applied to this problem, including analyzing gene...
Minghua Deng, Kui Zhang, Shipra Mehta, Ting Chen, ...
ICNP
2002
IEEE
15 years 7 months ago
Hybrid Channel Access Scheduling in Ad Hoc Networks
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...
Lichun Bao, J. J. Garcia-Luna-Aceves
DCC
2000
IEEE
15 years 7 months ago
Arithmetic Coding for Low Power Embedded System Design
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
Haris Lekatsas, Wayne Wolf, Jörg Henkel
ISORC
2000
IEEE
15 years 6 months ago
TCP Throughput and Buffer Management
There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unk...
Todd Lizambri, Fernando Duran, Shukri Wakid