Sciweavers

145 search results - page 4 / 29
» Front Representation of Set Partitions
Sort
View
CSMR
2002
IEEE
14 years 18 days ago
Data Exchange with the Columbus Schema for C++
To successfully carry out a software maintenance or reengineering task, a suitably assembled set of tools is required, which interoperate seaminglessly. To achieve this goal, an e...
Rudolf Ferenc, Árpád Beszédes
JCP
2007
149views more  JCP 2007»
13 years 7 months ago
Partitional Clustering Techniques for Multi-Spectral Image Segmentation
Abstract— Analyzing unknown data sets such as multispectral images often requires unsupervised techniques. Data clustering is a well known and widely used approach in such cases....
Danielle Nuzillard, Cosmin Lazar
ICIP
1999
IEEE
14 years 9 months ago
Representing and Retrieving Regions Using Binary Partition Trees
This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval. Binary Partition Trees c...
Luis Garrido, Philippe Salembier, Josep R. Casas
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
14 years 8 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
EURODAC
1995
IEEE
117views VHDL» more  EURODAC 1995»
13 years 11 months ago
Performance-complexity analysis in hardware-software codesign for real-time systems
The paper presents an approach for performance and complexity analysis of hardware/software implementations for real-time systems on every stage of the partitioning. There are two...
Victor V. Toporkov