Sciweavers

752 search results - page 70 / 151
» Faster approximation algorithms for the minimum latency prob...
Sort
View
COMCOM
2008
124views more  COMCOM 2008»
15 years 3 months ago
Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
Meng-Shiuan Pan, Yu-Chee Tseng
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
15 years 9 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
TCS
2008
15 years 3 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
16 years 5 days ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White