2403 search results - page 345 / 481 » Optimal Randomized RANSAC |
142
Voted
MOBICOM
2009
ACM
15 years 9 months ago
2009
ACM
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
119
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
The majority of existing wireless rate controls are based on the implicit assumption that frames are corrupted due to the random, arbitrary environmental and thermal noises. They ...
129
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
130
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
122
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...