Sciweavers

373 search results - page 46 / 75
» Identifying graphs from noisy and incomplete data
Sort
View
WWW
2010
ACM
13 years 7 months ago
Exploiting content redundancy for web information extraction
We propose a novel extraction approach that exploits content redundancy on the web to extract structured data from template-based web sites. We start by populating a seed database...
Pankaj Gulhane, Rajeev Rastogi, Srinivasan H. Seng...
MEMICS
2010
13 years 2 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
14 years 1 months ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas
WG
1993
Springer
13 years 11 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
TOG
2002
167views more  TOG 2002»
13 years 7 months ago
Interactive control of avatars animated with human motion data
Real-time control of three-dimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, howeve...
Jehee Lee, Jinxiang Chai, Paul S. A. Reitsma, Jess...