Sciweavers

688 search results - page 37 / 138
» General Partitioning on Random Graphs
Sort
View
WWW
2008
ACM
16 years 1 months ago
Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
Manjeet Rege, Ming Dong, Jing Hua
ICPR
2006
IEEE
16 years 1 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
FPGA
2001
ACM
152views FPGA» more  FPGA 2001»
15 years 4 months ago
A pipelined architecture for partitioned DWT based lossy image compression using FPGA's
Discrete wavelet transformations (DWT) followed by embedded zerotree encoding is a very efficient technique for image compression [2, 5, 4]. However, the algorithms proposed in l...
Jörg Ritter, Paul Molitor
AI
2010
Springer
15 years 2 months ago
Improving Multiclass Text Classification with Error-Correcting Output Coding and Sub-class Partitions
Error-Correcting Output Coding (ECOC) is a general framework for multiclass text classification with a set of binary classifiers. It can not only help a binary classifier solve mul...
Baoli Li, Carl Vogel
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
15 years 5 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...