Sciweavers

919 search results - page 96 / 184
» Efficient computation of view subsets
Sort
View
TVCG
2008
70views more  TVCG 2008»
13 years 10 months ago
Visualizing Incomplete and Partially Ranked Data
Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with t...
Paul Kidwell, Guy Lebanon, William S. Cleveland
CVPR
2007
IEEE
15 years 1 days ago
Multi-modal Clustering for Multimedia Collections
Most of the online multimedia collections, such as picture galleries or video archives, are categorized in a fully manual process, which is very expensive and may soon be infeasib...
Ron Bekkerman, Jiwoon Jeon
BMCBI
2005
94views more  BMCBI 2005»
13 years 10 months ago
A method for finding single-nucleotide polymorphisms with allele frequencies in sequences of deep coverage
Background: The allele frequencies of single-nucleotide polymorphisms (SNPs) are needed to select an optimal subset of common SNPs for use in association studies. Sequence-based m...
Jianmin Wang, Xiaoqiu Huang
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 9 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
ICCV
2003
IEEE
14 years 12 months ago
Visual Correspondence Using Energy Minimization and Mutual Information
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih