Sciweavers

2255 search results - page 204 / 451
» Computing a Center-Transversal Line
Sort
View
162
Voted
CVPR
2003
IEEE
15 years 9 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
103
Voted
ICDCSW
2003
IEEE
15 years 9 months ago
Dynamic, Adaptive and Reconfigurable Systems Overview and Prospective Vision
— Systems are more and more expected to work in dynamic environment, to deal with fluctuation of their characteristics and to guaranty functional and nonfunctional requirements. ...
Mehmet Aksit, Zièd Choukair
130
Voted
GD
2003
Springer
15 years 9 months ago
Track Drawings of Graphs with Constant Queue Number
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
Emilio Di Giacomo, Henk Meijer
108
Voted
IMR
2003
Springer
15 years 9 months ago
When and Why Ruppert's Algorithm Works
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...
Gary L. Miller, Steven E. Pav, Noel Walkington
100
Voted
HOTI
2002
IEEE
15 years 8 months ago
A Four-Terabit Single-Stage Packet Switch with Large Round-Trip Time Support
We present the architecture and practical VLSI implementation of a 4-Tb/s single-stage switch. It is based on a combined input- and crosspoint-queued structure with virtual output...
François Abel, Cyriel Minkenberg, Ronald P....