Sciweavers

721 search results - page 104 / 145
» Summability in topological spaces
Sort
View
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
15 years 11 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
CVPR
2010
IEEE
15 years 5 months ago
On Growth and Formlets: Sparse Multi-Scale Coding of Planar Shape
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...
Timothy Oleskiw, James Elder, Gabriel Peyr
CIDM
2009
IEEE
15 years 4 months ago
Density-based clustering of polygons
– Clustering is an important task in spatial data mining and spatial analysis. We propose a clustering algorithm P-DBSCAN to cluster polygons in space. PDBSCAN is based on the we...
Deepti Joshi, Ashok Samal, Leen-Kiat Soh
CEC
2007
IEEE
15 years 4 months ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers
ISVLSI
2007
IEEE
205views VLSI» more  ISVLSI 2007»
15 years 4 months ago
An Automated Passive Analog Circuit Synthesis Framework using Genetic Algorithms
In this work, we present a genetic algorithm based automated circuit synthesis framework for passive analog circuits. A procedure is developed for the simultaneous generation of b...
Angan Das, Ranga Vemuri