Sciweavers

301 search results - page 38 / 61
» On Finding Dense Subgraphs
Sort
View
UIST
2006
ACM
15 years 3 months ago
The design and evaluation of selection techniques for 3D volumetric displays
Volumetric displays, which display imagery in true 3D space, are a promising platform for the display and manipulation of 3D data. To fully leverage their capabilities, appropriat...
Tovi Grossman, Ravin Balakrishnan
APWEB
2006
Springer
15 years 1 months ago
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
Ting Wang
VLDB
2007
ACM
155views Database» more  VLDB 2007»
15 years 10 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
CIKM
2010
Springer
14 years 4 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
TCBB
2008
117views more  TCBB 2008»
14 years 9 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...