Sciweavers

8647 search results - page 504 / 1730
» The Container Selection Problem
Sort
View
CIKM
2009
Springer
16 years 28 days ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
167
Voted
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
Visualization of large influenza virus sequence datasets using adaptively aggregated trees with sampling-based subscale represen
Background: With the amount of influenza genome sequence data growing rapidly, researchers need machine assistance in selecting datasets and exploring the data. Enhanced visualiza...
Leonid Zaslavsky, Yiming Bao, Tatiana A. Tatusova
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 10 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
CVPR
2001
IEEE
16 years 8 months ago
Generic Model Abstraction from Examples
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
Yakov Keselman, Sven J. Dickinson
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 6 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li