Sciweavers

18306 search results - page 98 / 3662
» Algorithmics in Exponential Time
Sort
View
ICNP
2003
IEEE
15 years 3 months ago
Delay Analysis of IEEE 802.11 in Single-Hop Networks
This paper presents an analytical model to compute the average service time and jitter experienced by a packet when transmitted in a saturated IEEE 802.11 ad hoc network. In contr...
Marcelo M. Carvalho, J. J. Garcia-Luna-Aceves
STOC
2004
ACM
89views Algorithms» more  STOC 2004»
15 years 10 months ago
Hit-and-run from a corner
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...
László Lovász, Santosh Vempal...
ACL
1994
14 years 11 months ago
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
John Carroll
CCCG
2008
14 years 11 months ago
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
MOR
2008
53views more  MOR 2008»
14 years 9 months ago
Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times
We consider a queue with renewal arrivals and n exponential servers in the Halfin-Whitt heavy traffic regime, where n and the arrival rate increase without bound, so that a critic...
Rami Atar, Adam Shwartz