2168 search results - page 62 / 434 » Randomized Algorithms and Complexity Theory |
126
click to vote
SIGIR
2006
ACM
15 years 9 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
119
click to vote
CIAC
2010
Springer
16 years 9 days ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
125
click to vote
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
127
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
137
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...