Sciweavers

4250 search results - page 595 / 850
» Understanding the Requirements on Modelling Techniques
Sort
View
TSD
2010
Springer
15 years 5 months ago
Evaluation of a Sentence Ranker for Text Summarization Based on Roget's Thesaurus
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
Alistair Kennedy, Stan Szpakowicz
FAST
2009
15 years 5 months ago
Spyglass: Fast, Scalable Metadata Search for Large-Scale Storage Systems
The scale of today's storage systems has made it increasingly difficult to find and manage files. To address this, we have developed Spyglass, a file metadata search system t...
Andrew W. Leung, Minglong Shao, Timothy Bisson, Sh...
BMCBI
2011
14 years 11 months ago
Cell Subset Prediction for Blood Genomic Studies
Background: Genome-wide transcriptional profiling of patient blood samples offers a powerful tool to investigate underlying disease mechanisms and personalized treatment decisions...
Christopher R. Bolen, Mohamed Uduman, Steven H. Kl...
SIGIR
2012
ACM
13 years 9 months ago
Task complexity, vertical display and user interaction in aggregated search
Aggregated search is the task of blending results from specialized search services or verticals into the Web search results. While many studies have focused on aggregated search t...
Jaime Arguello, Wan-Ching Wu, Diane Kelly, Ashlee ...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...