Sciweavers

109 search results - page 21 / 22
» Answer Selection and Confidence Estimation
Sort
View
APGV
2007
ACM
130views Visualization» more  APGV 2007»
14 years 19 days ago
A perceptual approach to trimming unstructured lumigraphs
We present a novel perceptual method to reduce the visual redundancy of unstructured lumigraphs, an image based representation designed for interactive rendering. We combine featu...
Yann Morvan, Carol O'Sullivan
BMCBI
2006
130views more  BMCBI 2006»
13 years 8 months ago
CARMA: A platform for analyzing microarray datasets that incorporate replicate measures
Background: The incorporation of statistical models that account for experimental variability provides a necessary framework for the interpretation of microarray data. A robust ex...
Kevin A. Greer, Matthew R. McReynolds, Heddwen L. ...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
CP
2003
Springer
14 years 1 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
ICPP
2007
IEEE
14 years 2 months ago
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni