Sciweavers

4212 search results - page 614 / 843
» On Compressible Pairings and Their Computation
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
WWW
2011
ACM
15 years 1 months ago
A self-training approach for resolving object coreference on the semantic web
An object on the Semantic Web is likely to be denoted with multiple URIs by different parties. Object coreference resolution is to identify “equivalent” URIs that denote the ...
Wei Hu, Jianfeng Chen, Yuzhong Qu
TITB
2010
120views Education» more  TITB 2010»
15 years 1 months ago
A distributed, collaborative intelligent agent system approach for proactive postmarketing drug safety surveillance
Discovering unknown adverse drug reactions (ADRs) in postmarketing surveillance as early as possible is of great importance. The current approach to postmarketing surveillance prim...
Yanqing Ji, Hao Ying, Margo S. Farber, John Yen, P...
NAR
2011
256views Computer Vision» more  NAR 2011»
14 years 9 months ago
COSMIC: mining complete cancer genomes in the Catalogue of Somatic Mutations in Cancer
COSMIC (http://www.sanger.ac.uk/cosmic) curates comprehensive information on somatic mutations in human cancer. Release v48 (July 2010) describes over 136 000 coding mutations in ...
Simon A. Forbes, Nidhi Bindal, Sally Bamford, Char...
POPL
2011
ACM
14 years 9 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...