Sciweavers

7648 search results - page 1029 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 10 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
16 years 6 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
BMCBI
2005
113views more  BMCBI 2005»
15 years 6 months ago
PentaPlot: A software tool for the illustration of genome mosaicism
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...
Lutz Hamel, Olga Zhaxybayeva, J. Peter Gogarten
GLOBECOM
2007
IEEE
16 years 17 days ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
« Prev « First page 1029 / 1530 Last » Next »