1158 search results - page 183 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
164
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
176
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
157
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
162
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
148
click to vote
INFOCOM
2009
IEEE
16 years 21 days ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...