Sciweavers

66 search results - page 9 / 14
» Worst Cases of a Periodic Function for Large Arguments
Sort
View
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
TRANSCI
2008
94views more  TRANSCI 2008»
13 years 6 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...
CVPR
2005
IEEE
14 years 9 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas
LCN
1994
IEEE
13 years 11 months ago
The Ethernet Capture Effect: Analysis and Solution
We analyze the behavior of the Ethernet in networks with a small number of active stations, and describe what is known as the Ethernet capture effect, where a station transmits co...
K. K. Ramakrishnan, Henry Yang
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt