Sciweavers

3415 search results - page 143 / 683
» Lower Bounds for Kernelizations
Sort
View
SPAA
1993
ACM
15 years 8 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
TMC
2011
131views more  TMC 2011»
14 years 11 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
ICC
2007
IEEE
109views Communications» more  ICC 2007»
15 years 10 months ago
Theoretical Limits for Estimation of Vital Signal Parameters Using Impulse Radio UWB
— In this paper, Cramer-Rao lower bounds (CRLBs) for estimation of vital signal parameters, such as respiration and heart-beat rates, using ultra-wideband (UWB) pulses are derive...
Sinan Gezici, Zafer Sahinoglu
ISCC
2005
IEEE
130views Communications» more  ISCC 2005»
15 years 10 months ago
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah,...
ICALP
2005
Springer
15 years 10 months ago
Online Interval Coloring and Variants
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
Leah Epstein, Meital Levy