Sciweavers

1403 search results - page 75 / 281
» Set cover algorithms for very large datasets
Sort
View
RECOMB
2004
Springer
15 years 10 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
MVA
1990
14 years 11 months ago
Raster to Vector Conversion in a Map Interpretation System
This paper describesthe two components: thinning and vectorization,at the front end of a GeographicInformation System. The raster dataset associatedwith a map is very large. A sma...
Paul C. K. Kwok, T. John Turner
CVPR
2007
IEEE
15 years 11 months ago
Hybrid learning of large jigsaws
A jigsaw is a recently proposed generative model that describes an image as a composition of non-overlapping patches of varying shape, extracted from a latent image. By learning t...
Julia A. Lasserre, Anitha Kannan, John M. Winn
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
15 years 10 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
CIKM
2009
Springer
15 years 4 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...