Sciweavers

8294 search results - page 111 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
BMCBI
2010
95views more  BMCBI 2010»
15 years 4 months ago
An effective approach for identification of in vivo protein-DNA binding sites from paired-end ChIP-Seq data
Background: ChIP-Seq, which combines chromatin immunoprecipitation (ChIP) with high-throughput massively parallel sequencing, is increasingly being used for identification of prot...
Congmao Wang, Jie Xu, Dasheng Zhang, Zoe A. Wilson...
EUROPAR
2007
Springer
15 years 11 months ago
Experiences Understanding Performance in a Commercial Scale-Out Environment
Abstract. Clusters of loosely connected machines are becoming an important model for commercial computing. The cost/performance ratio makes these scale-out solutions an attractive ...
Robert W. Wisniewski, Reza Azimi, Mathieu Desnoyer...
IJCAI
2007
15 years 6 months ago
Word Sense Disambiguation with Spreading Activation Networks Generated from Thesauri
Most word sense disambiguation (WSD) methods require large quantities of manually annotated training data and/or do not exploit fully the semantic relations of thesauri. We propos...
George Tsatsaronis, Michalis Vazirgiannis, Ion And...
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
15 years 9 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
JDA
2006
184views more  JDA 2006»
15 years 4 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano