7015 search results - page 1065 / 1403 » Approximation algorithms for co-clustering |
132
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
219
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
183
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—IEEE 802.16e WiMAX is a promising new technology for broadband access networks. Amongst the class of applications that can be supported is real time video services (such...
171
click to vote
PODC
2005
ACM
16 years 7 days 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...
189
click to vote
COCO
2005
Springer
16 years 6 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...