Sciweavers

720 search results - page 126 / 144
» Nonrepetitive colorings of graphs
Sort
View
BMCBI
2010
223views more  BMCBI 2010»
13 years 2 months ago
MetNetGE: interactive views of biological networks and ontologies
Background: Linking high-throughput experimental data with biological networks is a key step for understanding complex biological systems. Currently, visualization tools for large...
Ming Jia, Suh-Yeon Choi, Dirk Reiners, Eve Syrkin ...
INFOCOM
2005
IEEE
14 years 1 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
ICC
2007
IEEE
145views Communications» more  ICC 2007»
14 years 1 months ago
Enhancements to Cognitive Radio Based IEEE 802.22 Air-Interface
—The IEEE 802.22 standard for wireless regional area network is the first standard for cognitive radio that tries to harness the idle or under-utilized spectrum allocated for TV...
Shamik Sengupta, Swastik Brahma, Mainak Chatterjee...
BVAI
2007
Springer
14 years 1 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...
EVOW
2007
Springer
14 years 1 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu