Sciweavers

3220 search results - page 231 / 644
» Constrained Graph Processes
Sort
View
ICDAR
2011
IEEE
14 years 6 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
MODELS
2007
Springer
16 years 19 days ago
Scenario Integration via the Transformation and Manipulation of Higher-order Graphs
The integration of different models, such as scenarios, is an important component of the requirements engineer’s work. If manually performed, the integration operation is error-...
Hongzhi Liang
WONS
2005
IEEE
16 years 2 days ago
Frequency Allocation for WLANs Using Graph Colouring Techniques
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
Janne Riihijärvi, Marina Petrova, Petri M&aum...
ISVC
2005
Springer
16 years 7 hour ago
Image Smoothing and Segmentation by Graph Regularization
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
Sébastien Bougleux, Abderrahim Elmoataz
ASAP
2006
IEEE
162views Hardware» more  ASAP 2006»
15 years 10 months ago
Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts
Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn Process Network specifications. These networks turn out to be close...
Ed F. Deprettere, Todor Stefanov, Shuvra S. Bhatta...