Sciweavers

2131 search results - page 102 / 427
» Immunity for Closed Sets
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 6 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
VISUALIZATION
2005
IEEE
15 years 12 months ago
Surface Reconstruction Via Contour Metamorphosis: An Eulerian Approach With Lagrangian Particle Tracking
We present a robust method for 3D reconstruction of closed surfaces from sparsely sampled parallel contours. A solution to this problem is especially important for medical segment...
Ola Nilsson, David E. Breen, Ken Museth
NAACL
2007
15 years 7 months ago
Entity Extraction is a Boring Solved Problem - Or is it?
This paper presents empirical results that contradict the prevailing opinion that entity extraction is a boring solved problem. In particular, we consider data sets that resemble ...
Marc Vilain, Jennifer Su, Suzi Lubar
ICIP
2002
IEEE
16 years 7 months ago
Visualization of high dynamic range images
A novel paradigm for information visualization in high dynamic range images is presented in this paper. These images, real or synthetic, have luminance with typical ranges many or...
Alvaro Pardo, Guillermo Sapiro
FSTTCS
2009
Springer
16 years 25 days ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer