Sciweavers

1039 search results - page 178 / 208
» Kernels and Regularization on Graphs
Sort
View
DOCENG
2003
ACM
15 years 5 months ago
Handling syntactic constraints in a DTD-compliant XML editor
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
Y. S. Kuo, Jaspher Wang, N. C. Shih
CVPR
2010
IEEE
15 years 4 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
15 years 4 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
IPPS
1996
IEEE
15 years 4 months ago
A New Approach to Pipeline FFT Processor
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
Shousheng He, Mats Torkelson
PLILP
1997
Springer
15 years 3 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola