Sciweavers

813 search results - page 29 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
TIP
2010
155views more  TIP 2010»
13 years 7 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 11 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
14 years 2 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
VL
2008
IEEE
115views Visual Languages» more  VL 2008»
14 years 3 months ago
Flexible visualization of automatic simulation based on structured graph transformation
Visual modeling languages for discrete behavior modeling allow the modeler to describe how systems develop over time during system runs. Models of these languages are the basis fo...
Enrico Biermann, Claudia Ermel, Jonas Hurrelmann, ...
MICCAI
2006
Springer
14 years 10 months ago
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
Ali Kemal Sinop, Leo Grady