Sciweavers

2107 search results - page 362 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
137
Voted
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
IS
2007
15 years 3 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ICC
2007
IEEE
15 years 9 months ago
Wireless Packet Scheduling With Soft Deadlines
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...
Aditya Dua, Nicholas Bambos
P2P
2007
IEEE
107views Communications» more  P2P 2007»
15 years 9 months ago
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...
Dimitri do B. DeFigueiredo, Balaji Venkatachalam, ...
BCB
2010
166views Bioinformatics» more  BCB 2010»
14 years 10 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...