2137 search results - page 280 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
158
Voted
STACS
2004
Springer
15 years 11 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
177
click to vote
BIOCOMP
2008
15 years 7 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
150
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
159
click to vote
ICCAD
2000
IEEE
15 years 10 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
185
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...