715 search results - page 94 / 143 » On graphs with subgraphs having large independence numbers |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
NIPS
2004
13 years 10 months ago
2004
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...