Sciweavers

136 search results - page 9 / 28
» Graph parameters and semigroup functions
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Optimized intrinsic dimension estimator using nearest neighbor graphs
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
Kumar Sricharan, Raviv Raich, Alfred O. Hero III
IPPS
2007
IEEE
14 years 1 months ago
Pipelining Tradeoffs of Massively Parallel SuperCISC Hardware Functions
Parallel processing using multiple processors is a well-established technique to accelerate many different classes of applications. However, as the density of chips increases, ano...
Colin J. Ihrig, Justin Stander, Alex K. Jones
PVLDB
2010
151views more  PVLDB 2010»
13 years 5 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
TIP
2011
164views more  TIP 2011»
13 years 2 months ago
Multiregion Image Segmentation by Parametric Kernel Graph Cuts
Abstractā€”The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
PRICAI
2004
Springer
14 years 22 days ago
Creative 3D Designs Using Interactive Genetic Algorithm with Structured Directed Graph
We propose a methodology for representing artificial creatures like 3D flowers. Directed graph and Lindenmayer system (L-system) are commonly involved in AI-based creativity resear...
Hyeun-Jeong Min, Sung-Bae Cho