Sciweavers

36 search results - page 7 / 8
» A new family of locally 5-arc transitive graphs
Sort
View
ICCAD
1999
IEEE
80views Hardware» more  ICCAD 1999»
14 years 3 months ago
What is the cost of delay insensitivity?
Deep submicron technology calls for new design techniques, in which wire and gate delays are accounted to have equal or nearly equal effect on circuit behaviour. Asynchronous spee...
Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, ...
APVIS
2001
14 years 8 days ago
Information Visualization of Attributed Relational Data
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
Mao Lin Huang
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 8 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
CVIU
2011
13 years 2 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
CORR
2007
Springer
60views Education» more  CORR 2007»
13 years 11 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap