Sciweavers

3020 search results - page 604 / 604
» Optimal partition trees
Sort
View
BMCBI
2010
104views more  BMCBI 2010»
12 years 11 months ago
A systematic study of genome context methods: calibration, normalization and combination
Background: Genome context methods have been introduced in the last decade as automatic methods to predict functional relatedness between genes in a target genome using the patter...
Luciana Ferrer, Joseph M. Dale, Peter D. Karp
CIKM
2010
Springer
12 years 11 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
TWC
2010
12 years 11 months ago
Lifetime-resource tradeoff for multicast traffic in wireless sensor networks
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
Vahid Shah-Mansouri, Vincent W. S. Wong
PLDI
2011
ACM
12 years 7 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 7 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu