Sciweavers

2944 search results - page 576 / 589
» Improving Bound Propagation
Sort
View
FOCS
2008
IEEE
14 years 10 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
SIGIR
2010
ACM
14 years 9 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
ALMOB
2008
92views more  ALMOB 2008»
14 years 9 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
ARSCOM
2007
63views more  ARSCOM 2007»
14 years 9 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
BMCBI
2010
121views more  BMCBI 2010»
14 years 9 months ago
Knowledge-based annotation of small molecule binding sites in proteins
Background: The study of protein-small molecule interactions is vital for understanding protein function and for practical applications in drug discovery. To benefit from the rapi...
Ratna R. Thangudu, Manoj Tyagi, Benjamin A. Shoema...