501 search results - page 97 / 101 » Rough Sets and Approximation Schemes |
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
GLOBECOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— In this paper, we investigate the outage performance of cognitive wireless relay networks where source nodes communicate to their destinations via multiple hops facilitated by ...