Sciweavers

37 search results - page 3 / 8
» What is the furthest graph from a hereditary property
Sort
View
WWW
2008
ACM
14 years 6 months ago
Statistical properties of community structure in large social and information networks
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Mi...
EJC
2007
13 years 5 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
13 years 5 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
13 years 11 months ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 8 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko