Sciweavers

9871 search results - page 1779 / 1975
» On the Structure of Low Sets
Sort
View
GROUP
2009
ACM
15 years 9 months ago
GroupMind: supporting idea generation through a collaborative mind-mapping tool
Collaborative brainstorming can be a challenging but important part of creative group problem solving. Mind-mapping has the potential to enhance the brainstorming process but has ...
Patrick C. Shih, David H. Nguyen, Sen H. Hirano, D...
VDA
2010
206views Visualization» more  VDA 2010»
15 years 9 months ago
Visual discovery in multivariate binary data
This paper presents the concept of Monotone Boolean Function Visual Analytics (MBFVA) and its application to the medical domain. The medical application is concerned with discover...
Boris Kovalerchuk, Florian Delizy, Logan Riggs, Ev...
AAAI
2008
15 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 8 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
COCOA
2008
Springer
15 years 8 months ago
Simplicial Powers of Graphs
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
Andreas Brandstädt, Van Bang Le
« Prev « First page 1779 / 1975 Last » Next »