Search

Your search keyword '"Cluster graph"' showing total 127 results
Start Over Descriptor "Cluster graph"
127 results on '"Cluster graph"'

3. Strengthening Probabilistic Graphical Models: The Purge-and-Merge Algorithm

Author

Simon Streicher and Johan A. Du Preez

Subjects
Probabilistic graphical model, probabilistic reasoning, belief propagation, cluster graph, sudoku, constraint-satisfaction problem, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Abstract

Probabilistic graphical models (PGMs) are powerful tools for solving systems of complex relationships over a variety of probability distributions. However, while tree-structured PGMs always result in efficient and exact solutions, inference on graph (or loopy) structured PGMs is not guaranteed to discover the optimal solutions. It is in principle possible to convert loopy PGMs to an equivalent tree structure, but this is usually impractical for interesting problems due to exponential blow-up. To address this, we developed the “purge-and-merge” algorithm. This algorithm iteratively nudges a malleable graph structure towards a tree structure by selectively merging factors. The merging process is designed to avoid exponential blow-up by way of sparse structures from which redundancy is purged as the algorithm progresses. We set up tasks to test the algorithm on constraint-satisfaction puzzles such as Sudoku, Fill-a-pix, and Kakuro, and it outperformed other PGM-based approaches reported in the literature. While the tasks we set focussed on the binary logic of CSP, we believe the purge-and-merge algorithm could be extended to general PGM inference.

Published
2021
Full Text
View/download PDF

4. FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters

Author

Majumdar, Diptapriyo, Raman, Venkatesh, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Xiao, Mingyu, editor, and Rosamond, Frances, editor

Published
2017
Full Text
View/download PDF

5. Approximate Association via Dissociation

Author

You, Jie, Wang, Jianxin, Cao, Yixin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Heggernes, Pinar, editor

Published
2016
Full Text
View/download PDF

7. Reducing Rank of the Adjacency Matrix by Graph Modification

Author

Meesum, S. M., Misra, Pranabendu, Saurabh, Saket, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Xu, Dachuan, editor, Du, Donglei, editor, and Du, Dingzhu, editor

Published
2015
Full Text
View/download PDF

8. Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing

Author

Hartung, Sepp, Hoos, Holger H., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Dhaenens, Clarisse, editor, Jourdan, Laetitia, editor, and Marmion, Marie-Eléonore, editor

Published
2015
Full Text
View/download PDF

9. From Symptoms to Diseases – Creating the Missing Link

Author

Oberkampf, Heiner, Gojayev, Turan, Zillner, Sonja, Zühlke, Dietlind, Auer, Sören, Hammon, Matthias, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Gandon, Fabien, editor, Sabou, Marta, editor, Sack, Harald, editor, d’Amato, Claudia, editor, Cudré-Mauroux, Philippe, editor, and Zimmermann, Antoine, editor

Published
2015
Full Text
View/download PDF

10. A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths

Author

Bazgan, Cristina, Nichterlein, André, Niedermeier, Rolf, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Paschos, Vangelis Th., editor, and Widmayer, Peter, editor

Published
2015
Full Text
View/download PDF

11. i-CODAS: An Improved Online Data Stream Clustering in Arbitrary Shaped Clusters.

Author

Islam, Md Kamrul, Ahmed, Md Manjur, and Zamli, Kamal Zuhairi

Subjects
*GRAPH connectivity, *ENVIRONMENTAL quality, *RIVERS, *DATA mining, *K-means clustering, *METADATA, *SCALABILITY
Abstract

Nowadays a lot of IT-based applications are generating huge data streams continuously, and clustering of these streams provide many advantages in data mining. In the field of clustering of data stream, density-based technique is the most popular as it is able to generate arbitrary shaped cluster with high cluster quality in a noisy environment. However, most of the existing density-based algorithms for data stream clustering are either offline or hybrid of offline and online phase or can handle only hyper-elliptical clusters. But offline algorithms are not good choice for data stream clustering as storing the data stream is impractical and often the shape of the cluster is arbitrary rather than regular in data space. Recently, an online clustering method called CODAS has been proposed where the generated clusters are arbitrary in shape. However, like other existing density based clustering algorithms, the radius of all micro-cluster in CODAS is global and constant. But it is really hard to set the optimal value of micro-cluster radius in practical, and a global radius may not be optimal for each micro-cluster. An erroneous choice of radius decreases the clustering quality remarkably. In this paper, we present an improved version of CODAS called i-CODAS based on the concept of maintaining local radius for each micro-cluster independently. The radius is updated in an online manner towards its local optimal value as new data sample lies in the cluster. The data samples are summarized in a metadata, called micro-cluster. The micro-clusters are presented in a clustering graph based on the connectivity among micro-clusters. The clustering graph is finally used to generate arbitrary shaped clusters. The performance of the proposed i-CODAS is measured and compared with other density-based clustering algorithms. The experimental result proves the superiority of i-CODAS over other clustering algorithms in terms of noise sensitivity, accuracy, purity, processing speed and scalability. [ABSTRACT FROM AUTHOR]

Published
2019

12. A Graph Modification Approach for Finding Core–Periphery Structures in Protein Interaction Networks

Author

Bruckner, Sharon, Hüffner, Falk, Komusiewicz, Christian, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Istrail, Sorin, Series editor, Pevzner, Pavel, Series editor, Waterman, Michael S., Series editor, Brown, Dan, editor, and Morgenstern, Burkhard, editor

Published
2014
Full Text
View/download PDF

13. Fast Dynamic Graph Algorithms for Parameterized Problems

Author

Iwata, Yoichi, Oka, Keigo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Ravi, R., editor, and Gørtz, Inge Li, editor

Published
2014
Full Text
View/download PDF

14. A Fast Branching Algorithm for Cluster Vertex Deletion

Author

Boral, Anudhyan, Cygan, Marek, Kociumaka, Tomasz, Pilipczuk, Marcin, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Hirsch, Edward A., editor, Kuznetsov, Sergei O., editor, Pin, Jean-Éric, editor, and Vereshchagin, Nikolay K., editor

Published
2014
Full Text
View/download PDF

15. Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

Author

Guo, Jiong, Shrestha, Yash Raj, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Pal, Sudebkumar Prasant, editor, and Sadakane, Kunihiko, editor

Published
2014
Full Text
View/download PDF

16. Cluster Editing with Locally Bounded Modifications Revisited

Author

Damaschke, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Lecroq, Thierry, editor, and Mouchard, Laurent, editor

Published
2013
Full Text
View/download PDF

17. A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems

Author

Froese, Vincent, van Bevern, René, Niedermeier, Rolf, Sorge, Manuel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chatterjee, Krishnendu, editor, and Sgall, Jirí, editor

Published
2013
Full Text
View/download PDF

18. Shrinking the Search Space for Clustered Planarity

Author

Chimani, Markus, Klein, Karsten, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Didimo, Walter, editor, and Patrignani, Maurizio, editor

Published
2013
Full Text
View/download PDF

19. The Multi-parameterized Cluster Editing Problem

Author

Abu-Khzam, Faisal N., Hutchison, David, Serieseditor, Kanade, Takeo, Serieseditor, Kittler, Josef, Serieseditor, Kleinberg, Jon M., Serieseditor, Mattern, Friedemann, Serieseditor, Mitchell, John C., Serieseditor, Naor, Moni, Serieseditor, Nierstrasz, Oscar, Serieseditor, Pandu Rangan, C., Serieseditor, Steffen, Bernhard, Serieseditor, Sudan, Madhu, Serieseditor, Terzopoulos, Demetri, Serieseditor, Tygar, Doug, Serieseditor, Vardi, Moshe Y., Serieseditor, Weikum, Gerhard, Serieseditor, Widmayer, Peter, editor, Xu, Yinfeng, editor, and Zhu, Binhai, editor

Published
2013
Full Text
View/download PDF

21. Interval Scheduling and Colorful Independent Sets

Author

van Bevern, René, Mnich, Matthias, Niedermeier, Rolf, Weller, Mathias, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chao, Kun-Mao, editor, Hsu, Tsan-sheng, editor, and Lee, Der-Tsai, editor

Published
2012
Full Text
View/download PDF

22. On the Parameterized Complexity of Consensus Clustering

Author

Dörnfelder, Martin, Guo, Jiong, Komusiewicz, Christian, Weller, Mathias, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Asano, Takao, editor, Nakano, Shin-ichi, editor, Okamoto, Yoshio, editor, and Watanabe, Osamu, editor

Published
2011
Full Text
View/download PDF

23. Alternative Parameterizations for Cluster Editing

Author

Komusiewicz, Christian, Uhlmann, Johannes, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Černá, Ivana, editor, Gyimóthy, Tibor, editor, Hromkovič, Juraj, editor, Jefferey, Keith, editor, Králović, Rastislav, editor, Vukolić, Marko, editor, and Wolf, Stefan, editor

Published
2011
Full Text
View/download PDF

24. Improving CLOPE’s Profit Value and Stability with an Optimized Agglomerative Approach

Author

Yefeng Li, Jiajin Le, and Mei Wang

Subjects
CLOPE, categorical data, optimized agglomerative approach, cluster graph, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95
Abstract

CLOPE (Clustering with sLOPE) is a simple and fast histogram-based clustering algorithm for categorical data. However, given the same data set with the same input parameter, the clustering results by this algorithm would possibly be different if the transactions are input in a different sequence. In this paper, a hierarchical clustering framework is proposed as an extension of CLOPE to generate stable and satisfactory clustering results based on an optimized agglomerative merge process. The new clustering profit is defined as the merge criteria and the cluster graph structure is proposed to optimize the merge iteration process. The experiments conducted on two datasets both demonstrate that the agglomerative approach achieves stable clustering results with a better profit value, but costs much more time due to the worse complexity.

Published
2015
Full Text
View/download PDF

25. Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs

Author

Heggernes, Pinar, Lokshtanov, Daniel, Nederlof, Jesper, Paul, Christophe, Telle, Jan Arne, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Thilikos, Dimitrios M., editor

Published
2010
Full Text
View/download PDF

26. Kernelization through Tidying : A Case Study Based on s-Plex Cluster Vertex Deletion

Author

van Bevern, René, Moser, Hannes, Niedermeier, Rolf, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and López-Ortiz, Alejandro, editor

Published
2010
Full Text
View/download PDF

27. Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms

Author

Damaschke, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chen, Jianer, editor, and Fomin, Fedor V., editor

Published
2009
Full Text
View/download PDF

28. Graph-Based Data Clustering with Overlaps

Author

Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Ngo, Hung Q., editor

Published
2009
Full Text
View/download PDF

29. A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing

Author

Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Johannes, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goldberg, Andrew V., editor, and Zhou, Yunhong, editor

Published
2009
Full Text
View/download PDF

30. Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Author

Guo, Jiong, Moser, Hannes, Niedermeier, Rolf, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Lerner, Jürgen, editor, Wagner, Dorothea, editor, and Zweig, Katharina A., editor

Published
2009
Full Text
View/download PDF

31. Using Graphs for Interactome Data

Author

Chiang, T., Falcon, S., Hahne, F., Huber, W., Gentleman, Robert, editor, Hornik, Kurt, editor, Parmigiani, Giovanni, editor, Hahne, Florian, Huber, Wolfgang, and Falcon, Seth

Published
2008
Full Text
View/download PDF

32. A Query Language and Its Processing for Time-Series Document Clusters

Author

Khy, Sophoin, Ishikawa, Yoshiharu, Kitagawa, Hiroyuki, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Buchanan, George, editor, Masoodian, Masood, editor, and Cunningham, Sally Jo, editor

Published
2008
Full Text
View/download PDF

33. Iterative Compression and Exact Algorithms

Author

Fomin, Fedor V., Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu, Saurabh, Saket, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ochmański, Edward, editor, and Tyszkiewicz, Jerzy, editor

Published
2008
Full Text
View/download PDF

34. Clustering with Partial Information

Author

Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Rosamond, Frances, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ochmański, Edward, editor, and Tyszkiewicz, Jerzy, editor

Published
2008
Full Text
View/download PDF

35. Fixed-Parameter Algorithms for Cluster Vertex Deletion

Author

Hüffner, Falk, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Laber, Eduardo Sany, editor, Bornstein, Claudson, editor, Nogueira, Loana Tito, editor, and Faria, Luerbio, editor

Published
2008
Full Text
View/download PDF

37. A More Effective Linear Kernelization for Cluster Editing

Author

Guo, Jiong, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chen, Bo, editor, Paterson, Mike, editor, and Zhang, Guochuan, editor

Published
2007
Full Text
View/download PDF

38. Efficient Parameterized Preprocessing for Cluster Editing

Author

Fellows, Michael, Langston, Michael, Rosamond, Frances, Shaw, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Csuhaj-Varjú, Erzsébet, editor, and Ésik, Zoltán, editor

Published
2007
Full Text
View/download PDF

39. Experimental Study of Geometric t-Spanners: A Running Time Comparison

Author

Farshi, Mohammad, Gudmundsson, Joachim, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Demetrescu, Camil, editor

Published
2007
Full Text
View/download PDF

41. Approximate Distance Queries in Disk Graphs

Author

Fürer, Martin, Kasiviswanathan, Shiva Prasad, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Erlebach, Thomas, editor, and Kaklamanis, Christos, editor

Published
2007
Full Text
View/download PDF

42. Fixed-Parameter Tractable Generalizations of Cluster Editing

Author

Damaschke, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Calamoneri, Tiziana, editor, Finocchi, Irene, editor, and Italiano, Giuseppe F., editor

Published
2006
Full Text
View/download PDF

44. PDE-Based Three Dimensional Path Planning for Virtual Endoscopy

Author

Hassouna, M. Sabry, Farag, A. A., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Christensen, Gary E., editor, and Sonka, Milan, editor

Published
2005
Full Text
View/download PDF

45. On the Fixed-Parameter Enumerability of Cluster Editing

Author

Damaschke, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Kratsch, Dieter, editor

Published
2005
Full Text
View/download PDF

46. A Structural View on Parameterizing Problems: Distance from Triviality

Author

Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Downey, Rod, editor, Fellows, Michael, editor, and Dehne, Frank, editor

Published
2004
Full Text
View/download PDF

49. Content‐based image retrieval based on binary signatures cluster graph.

Author

Van, Thanh The and Le, Thanh Manh

Subjects
*IMAGE retrieval, *ALGORITHMS, *IMAGE segmentation, *DATA structures, *GRAPH theory
Abstract

Abstract: In this paper, we approach a method of clustering binary signature of image in order to create a clustering graph structure for building the content‐based image retrieval. First, the paper presents the segmentation method based on low‐level visual features including colour and texture of image. On the basis of segmented image, the paper creates binary signature to describe location, colour, and shape of interest objects. In order to match similar images, the paper presents a similarity measure between the images based on binary signature. From that, the paper proposes the method of clustering binary signature to quickly query similar images. At the same time, the graph data structure is built using the partition cluster technique and the rules of binary signatures' distribution of images. On the basis of data structure, we propose a graph creation algorithm, a cluster splitting/merging algorithm, and a similarity image retrieval algorithm. To illustrate the proposed theory, we build an image retrieval application and assess the experimental results on the image datasets including COREL (1,000 images), CBIR images (1,344 images), WANG (10,800 images), MSRDI (15,720 images), and ImageCLEF (20,000 images). [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

50. Approximate association via dissociation.

Author

You, Jie, Wang, Jianxin, and Cao, Yixin

Subjects
*APPROXIMATION theory, *COMBINATORICS, *SET theory, *GEOMETRIC vertices, *MODULAR arithmetic, *MATHEMATICAL models
Abstract

A vertex set X of a graph G is an association set if each component of G − X is a clique, and a dissociation set if each of these cliques has only one or two vertices. We observe some special structures and show that if none of them exists, then the minimum association set problem can be reduced to the minimum weighted dissociation set problem. This yields the first nontrivial approximation algorithm for the association set problem, with approximation ratio 2.5. The reduction is based on a combinatorial study of modular decomposition of graphs free of these special structures. Further, a novel algorithmic use of modular decomposition enables us to implement our algorithm in O ( m n + n 2 ) time. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results