Sciweavers

271 search results - page 5 / 55
» Improving the Average Delay of Sorting
Sort
View
APNOMS
2006
Springer
13 years 11 months ago
Improving Handoff Performance by Using Distance-Based Dynamic Hysteresis Value
Abstract. In this study, an adaptive handoff algorithm with a dynamic hysteresis value, based on the distance between the mobile station and the serving base station, is proposed f...
Huamin Zhu, Kyung Sup Kwak
DFT
2004
IEEE
93views VLSI» more  DFT 2004»
13 years 11 months ago
First Level Hold: A Novel Low-Overhead Delay Fault Testing Technique
This paper presents a novel delay fault testing technique, which can be used as an alternative to the enhanced scan based delay fault testing, with significantly less design overh...
Swarup Bhunia, Hamid Mahmoodi-Meimand, Arijit Rayc...
JSAC
2008
136views more  JSAC 2008»
13 years 7 months ago
Fixed point opportunistic routing in delay tolerant networks
We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the avera...
Vania Conan, Jeremie Leguay, Timur Friedman
STOC
2001
ACM
132views Algorithms» more  STOC 2001»
14 years 8 months ago
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
Ravi Montenegro, Jung-Bae Son
DOLAP
2007
ACM
13 years 11 months ago
Optimal chunking of large multidimensional arrays for data warehousing
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
Ekow J. Otoo, Doron Rotem, Sridhar Seshadri