5592 search results - page 967 / 1119 » On Random Betweenness Constraints |
155
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
148
click to vote
RECOMB
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
128
click to vote
RECOMB
2004
Springer
16 years 5 months ago
2004
Springer
Identifying gene clusters, genomic regions that share local similarities in gene organization, is a prerequisite for many different types of genomic analyses, including operon pred...
122
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
130
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...