Sciweavers

966 search results - page 71 / 194
» Small Alliances in Graphs
Sort
View
CAIP
2005
Springer
160views Image Analysis» more  CAIP 2005»
14 years 2 months ago
Supervised Texture Detection in Images
This paper presents a technique for texture segmentation in images. Providing a small template of a texture of interest results in the image being segmented into regions with simil...
Branislav Micusík, Allan Hanbury
GD
2001
Springer
14 years 1 months ago
Orthogonal Drawings with Few Layers
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
Therese C. Biedl, John R. Johansen, Thomas C. Sher...
APVIS
2007
13 years 10 months ago
Interpreting large visual similarity matrices
Visual similarity matrices (VSMs) are a common technique for visualizing graphs and other types of relational data. While traditionally used for small data sets or well-ordered la...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
INFOCOM
2012
IEEE
11 years 11 months ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...
TIT
1998
79views more  TIT 1998»
13 years 8 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård