Sciweavers

1736 search results - page 318 / 348
» The rank-width of Directed Graphs
Sort
View
BMCBI
2005
121views more  BMCBI 2005»
15 years 13 days ago
Automated methods of predicting the function of biological sequences using GO and BLAST
Background: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with hig...
Craig E. Jones, Ute Baumann, Alfred L. Brown
133
Voted
FOCS
2008
IEEE
15 years 7 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
98
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Minimum Cost Topology Construction for Rural Wireless Mesh Networks
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, ...
100
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
INFOCOM
2006
IEEE
15 years 6 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz