Sciweavers

27692 search results - page 5537 / 5539
» Where is ...
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
JCT
2010
113views more  JCT 2010»
13 years 6 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman
SENSYS
2010
ACM
13 years 5 months ago
Surviving wi-fi interference in low power ZigBee networks
Frequency overlap across wireless networks with different radio technologies can cause severe interference and reduce communication reliability. The circumstances are particularly...
Chieh-Jan Mike Liang, Bodhi Priyantha, Jie Liu, An...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 4 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Xuan-Chao Huang, Jay Cheng
ALGORITHMICA
2011
13 years 2 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
« Prev « First page 5537 / 5539 Last » Next »