Search results for "clique"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Iordanis Koutsopoulos, Leandros Tassiulas	Joint optimal access point selection and channel assignment in wireless networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	access point (AP) assignment, load balancing, channel allocation, wireless access
17	Noga Alon, Eyal Lubetzky	Codes And Xor Graph Products.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C69, 94A15
17	Robert Bernecky	Shape cliques.	ACM SIGAPL APL Quote Quad	2007	DBLP DOI BibTeX RDF
17	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
17	Florian Verhein, Ghazi Al-Naymat	Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT.	ICDM Workshops	2007	DBLP DOI BibTeX RDF
17	Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz	Optimization problems in multiple-interval graphs.	SODA	2007	DBLP BibTeX RDF
17	Mohamed Didi Biha, Bangaly Kaba, Marie-Jean Meurs, Eric SanJuan	Graph Decomposition Approaches for Terminology Graphs.	MICAI	2007	DBLP DOI BibTeX RDF	polyhedral approach, topic vizualisation, text mining, graph algorithms, graph decomposition
17	Samuel Rota Bulò, Marcello Pelillo	A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs.	LION	2007	DBLP DOI BibTeX RDF
17	Andrea Torsello, Andrea Albarelli, Marcello Pelillo	Matching Relational Structures using the Edge-Association Graph.	ICIAP	2007	DBLP DOI BibTeX RDF
17	Janez Konc, Dusanka Janezic	A Branch and Bound Algorithm for Matching Protein Structures.	ICANNGA (2)	2007	DBLP DOI BibTeX RDF
17	Landon P. Cox, Angela Dalton, Varun Marupadi	SmokeScreen: flexible privacy controls for presence-sharing.	MobiSys	2007	DBLP DOI BibTeX RDF	presence-sharing, mobile computing, social networks, pervasive computing, location privacy
17	Jae-Woo Chang, Hyunjo Lee	High-Dimensional Clustering Method for High Performance Data Mining.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	High-Dimensional Clustering, Data Mining
17	Brian Potetz	Efficient Belief Propagation for Vision Using Linear Constraint Nodes.	CVPR	2007	DBLP DOI BibTeX RDF
17	Hakim Badis	An efficient bandwidth guaranteed routing for ad hoc networks using ieee 802.11 with interference consideration.	MSWiM	2007	DBLP DOI BibTeX RDF	qos flows, wireless ad hoc networks, interference, capacity
17	Ding Xiao, Nan Du, Bin Wu 0001, Bai Wang 0001	Community Ranking in Social Network.	IMSCCS	2007	DBLP DOI BibTeX RDF
17	Cheng-Fa Tsai, Chia-Chen Yen	ANGEL: A New Effective and Efficient Hybrid Clustering Technique for Large Databases.	PAKDD	2007	DBLP DOI BibTeX RDF	hybrid clustering algorithm, data mining, data clustering
17	Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas	Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.	AAIM	2007	DBLP DOI BibTeX RDF
17	Wayne J. Pullan	Protein Structure Alignment Using Maximum Cliques and Local Search.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF
17	Monia Giandomenico, Adam N. Letchford	Exploring the Relationship Between Max-Cut and Stable Set Relaxations.	Math. Program.	2006	DBLP DOI BibTeX RDF	Stable set problem, Polyhedral combinatorics, Max-cut problem
17	Hong Lu 0015, Steve Liu	Upperbounding End-to-End Throughput of Multihop Wireless Networks.	WASA	2006	DBLP DOI BibTeX RDF
17	Olivier Laurent 0001, Lorenzo Tortora de Falco	Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity.	LICS	2006	DBLP DOI BibTeX RDF
17	Subhash Khot, Ashok Kumar Ponnuswami	Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion.	ICALP (1)	2006	DBLP DOI BibTeX RDF
17	Jia Zeng, Zhi-Qiang Liu	Stroke Segmentation of Chinese Characters Using Markov Random Fields.	ICPR (1)	2006	DBLP DOI BibTeX RDF
17	Vasanth Krishna Namasivayam, Animesh Pathak, Viktor K. Prasanna	Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference.	SBAC-PAD	2006	DBLP DOI BibTeX RDF
17	Michele Pagani	Acyclicity and Coherence in Multiplicative Exponential Linear Logic.	CSL	2006	DBLP DOI BibTeX RDF
17	Parikshit Gopalan	Constructing Ramsey Graphs from Boolean Function Representations.	CCC	2006	DBLP DOI BibTeX RDF
17	Julian J. McAuley, Tibério S. Caetano, Alexander J. Smola, Matthias O. Franz	Learning high-order MRF priors of color images.	ICML	2006	DBLP DOI BibTeX RDF
17	Kun Sun 0001, Pai Peng, Peng Ning, Cliff Wang	Secure Distributed Cluster Formation in Wireless Sensor Networks.	ACSAC	2006	DBLP DOI BibTeX RDF
17	Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti	Packing r-Cliques in Weighted Chordal Graphs.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	min-max theorems, linear programming duality, complementary slackness, greedy algorithms, chordal graphs
17	Sarvesh Bhardwaj, Sarma B. K. Vrudhula, David T. Blaauw	Probability distribution of signal arrival times using Bayesian networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2005	DBLP DOI BibTeX RDF
17	Orhan Coskun, Keith M. Chugg	Combined Coding and Training for Unknown ISI Channels.	IEEE Trans. Commun.	2005	DBLP DOI BibTeX RDF
17	Jan Kára, Attila Pór, David R. Wood	On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
17	Xiaohong Sheng, Yu Hen Hu, Parmesh Ramanathan	Distributed particle filter with GMM approximation for multiple targets localization and tracking in wireless sensor network.	IPSN	2005	DBLP DOI BibTeX RDF
17	Daniel Meister 0001	Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.	WG	2005	DBLP DOI BibTeX RDF
17	W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang 0013, Christopher T. Symons, Nagiza F. Samatova, Michael A. Langston	A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem.	COCOON	2005	DBLP DOI BibTeX RDF
17	Krishnaram Kenthapadi, Gurmeet Singh Manku	Decentralized algorithms using both local and random probes for P2P load balancing.	SPAA	2005	DBLP DOI BibTeX RDF	bins and balls, coupon collection, load balancing, distributed hash tables, peer to peer systems, binary trees, cliques, decentralized algorithms
17	José M. Bioucas-Dias, Gonçalo Valadão	Discontinuity Preserving Phase Unwrapping Using Graph Cuts.	EMMCVPR	2005	DBLP DOI BibTeX RDF
17	Martin Grohe, György Turán	Learnability and Definability in Trees and Similar Structures.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
17	Andreas Goerdt, André Lanka	On the Hardness and Easiness of Random 4-SAT Formulas.	ISAAC	2004	DBLP DOI BibTeX RDF
17	Ken'ichiro Shirose, Satoshi Matsuoka, Hidemoto Nakada, Hirotaka Ogawa	Autonomous Con.guration of Grid Monitoring Systems.	SAINT Workshops	2004	DBLP DOI BibTeX RDF
17	Stamatis Stefanakos, Thomas Erlebach	Routing in all-optical ring networks revisited.	ISCC	2004	DBLP DOI BibTeX RDF
17	L. Sunil Chandran, N. S. Narayanaswamy	On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.	COCOON	2004	DBLP DOI BibTeX RDF
17	Tatsuie Tsukiji, Zhi-Zhong Chen	Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard.	COCOON	2004	DBLP DOI BibTeX RDF
17	Benjamin Taskar, Vassil Chatalbashev, Daphne Koller	Learning associative Markov networks.	ICML	2004	DBLP DOI BibTeX RDF
17	John Gimbel	Some Remarks on the Convexity Number of a Graph.	Graphs Comb.	2003	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad	Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs.	FCT	2003	DBLP DOI BibTeX RDF
17	Kouichi Hirata	On Condensation of a Clause.	ILP	2003	DBLP DOI BibTeX RDF
17	József Beck	Positional Games and the Second Moment Method.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 91A24
17	Gary Chartrand, Curtiss E. Wall, Ping Zhang 0004	The Convexity Number of a Graph.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
17	Martin Grohe, György Turán	Learnability and Definability in Trees and Similar Structures.	STACS	2002	DBLP DOI BibTeX RDF
17	Hiroko Ishii, Hirotsugu Kakugawa	A Self-Stabilizing Algorithm for Finding Cliques in Distributed Systems.	SRDS	2002	DBLP DOI BibTeX RDF
17	Jianzhuang Liu, Yong Tsui Lee	A Graph-Based Method for Face Identification from a Single 2D Line Drawing.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF
17	Marcus Peinado	Go with the Winners Algorithms for Cliques in Random Graphs.	ISAAC	2001	DBLP DOI BibTeX RDF
17	Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker	Many-to-many Matching of Attributed Trees Using Association Graphs and Game Dynamics.	IWVF	2001	DBLP DOI BibTeX RDF
17	Sonny Han Seng Chee, Jiawei Han 0001, Ke Wang 0001	RecTree: An Efficient Collaborative Filtering Method.	DaWaK	2001	DBLP DOI BibTeX RDF
17	Baogang Xu	Plane Graphs with Acyclic Complex.	COCOON	2001	DBLP DOI BibTeX RDF
17	Alessio Massaro, Marcello Pelillo	A Complementary Pivoting Approach to Graph Matching.	EMMCVPR	2001	DBLP DOI BibTeX RDF
17	Andrea Torsello, Edwin R. Hancock	Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling.	EMMCVPR	2001	DBLP DOI BibTeX RDF
17	Cheng-Hsing Yang, Sao-Jie Chen, Jan-Ming Ho, Chia-Chun Tsai	Efficient routability check algorithms for segmented channel routing.	ACM Trans. Design Autom. Electr. Syst.	2000	DBLP DOI BibTeX RDF	field programmable gate arryas (FPGAs), segmented channel, routing
17	Johan Håstad	Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?	ICALP	2000	DBLP DOI BibTeX RDF
17	Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker	Attributed Tree Homomorphism Using Association Graphs.	ICPR	2000	DBLP DOI BibTeX RDF
17	Vincent Bouchitté, Ioan Todinca	Listing All Potential Maximal Cliques of a Graph.	STACS	2000	DBLP DOI BibTeX RDF
17	S. Bharitkar, Kazuhiro Tsuchiya, Yoshiyasu Takefuji	Microcode optimization with neural networks.	IEEE Trans. Neural Networks	1999	DBLP DOI BibTeX RDF
17	Öjvind Johansson	NLC2-Decomposition in Polynomial Time.	WG	1999	DBLP DOI BibTeX RDF
17	Dieter Kratsch, Lorna Stewart	Approximating Bandwidth by Mixing Layouts of Interval Graphs.	STACS	1999	DBLP DOI BibTeX RDF
17	Sanjeev Arora, Carsten Lund, Rajeev Motwani 0001, Madhu Sudan 0001, Mario Szegedy	Proof Verification and the Hardness of Approximation Problems.	J. ACM	1998	DBLP DOI BibTeX RDF	optimization, NP-completeness, randomness, proof verification
17	Iftekhar Hussain, Todd R. Reed	A bond percolation-based model for image segmentation.	IEEE Trans. Image Process.	1997	DBLP DOI BibTeX RDF
17	Uriel Feige, Shafi Goldwasser, László Lovász 0001, Shmuel Safra, Mario Szegedy	Interactive Proofs and the Hardness of Approximating Cliques.	J. ACM	1996	DBLP DOI BibTeX RDF	independent set in a graph, multilinearity testing np-completeness, hardness of approximation, probabilistically checkable proofs
17	Marcus Peinado	Hard Graphs for Randomized Subgraph Exclusion Algorithms.	SWAT	1994	DBLP DOI BibTeX RDF
17	Feodor F. Dragan	Dominating Cliques in Distance-Hereditary Graphs.	SWAT	1994	DBLP DOI BibTeX RDF
17	Sorin Istrail, Dejan Zivkovic	A Non-Probabilistic Switching Lemma for the Sipser Function.	STACS	1993	DBLP DOI BibTeX RDF
17	James W. Modestino, Jun Zhang 0006	A Markov Random Field Model-Based Approach to Image Interpretation.	IEEE Trans. Pattern Anal. Mach. Intell.	1992	DBLP DOI BibTeX RDF	Markov random field model-based approach, disjoint regions, object labels, extracted feature measurements, interpretation labels, pattern recognition, pattern recognition, graph theory, simulated annealing, simulated annealing, picture processing, picture processing, Markov processes, domain knowledge, spatial relationships, image interpretation, synthetic images, adjacency graph, real-world images
17	Ravi B. Boppana, Magnús M. Halldórsson	Approximating Maximum Independent Sets by Excluding Subgraphs.	SWAT	1990	DBLP DOI BibTeX RDF
17	Pierre G. Paulin, John P. Knight	Scheduling and Binding Algorithms for High-Level Synthesis.	DAC	1989	DBLP DOI BibTeX RDF
17	Ravi Krishnamurthy, Raghu Ramakrishnan 0001, Oded Shmueli	A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract).	SIGMOD Conference	1988	DBLP DOI BibTeX RDF	DATALOG
17	Elias Dahlhaus, Marek Karpinski	A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract).	SWAT	1988	DBLP DOI BibTeX RDF
15	Xuchu Dong, Dantong Ouyang, Yuxin Ye, Shasha Feng, Haihong Yu	A Stable Stochastic Optimization Algorithm for Triangulation of Bayesian Networks.	WKDD	2010	DBLP DOI BibTeX RDF	clique tree, genetic algorithm, heuristics, Bayesian networks, ant colony optimization
15	Steffen Rebennack	Stable Set Problem: Branch & Cut Algorithms.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Stable set, Vertex packing, Branch & Cut, Separation, Independent set, Maximum clique, Exact method
15	Immanuel M. Bomze	Standard Quadratic Optimization Problems: Applications.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Simplicial partition, Branch and bound, Portfolio selection, Maximum weight clique
15	Marcello Pelillo	Replicator Dynamics in Combinatorial Optimization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Heuristics, Graph, Dynamical system, Quadratic programming, Clique, Evolutionary game theory
15	Thomas Wennekers	On the Natural Hierarchical Composition of Cliques in Cell Assemblies.	Cogn. Comput.	2009	DBLP DOI BibTeX RDF	Clique codes, Formal concept analysis, Associative memory, Bio-inspired computing, Cell assemblies
15	Esther Ezra, János Pach, Micha Sharir	On Regular Vertices of the Union of Planar Convex Objects.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Geometric arrangements, Union of planar regions, Regular vertices, Bi-clique decompositions, (1/r)-cuttings, Lower envelopes
15	Jeonghee Yi, Farzin Maghoul	Query clustering using click-through graph.	WWW	2009	DBLP DOI BibTeX RDF	biclique, click-through graph, equivalence set, maximal bipartite clique, query clustring, query intent
15	Yongpeng Zhang, Feng Duan, Rui Cui	An Edge-Preserving Wavelet Denoising Method Based on MRF.	ICIG	2009	DBLP DOI BibTeX RDF	wavelet, MRF, denoising, clique, soft-threshold
15	Mahmood Fazlali, Mohammad K. Fallah, Mahdy Zolghadr, Ali Zakerolhosseini	A New Datapath Merging Method for Reconfigurable System.	ARC	2009	DBLP DOI BibTeX RDF	Datapath Merging, Maximum Weighted Clique Algorithm, High Level Synthesis, Reconfigurable Computing
15	Kamrul Islam 0001, Selim G. Akl, Henk Meijer	Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks.	DCOSS	2009	DBLP DOI BibTeX RDF	Minimum Vertex-cut, Wireless Sensor Network, Distributed Algorithm, Maximal Clique
15	Lilian Markenzon, Oswaldo Vernet, Luiz Henrique Araujo	Two methods for the generation of chordal graphs.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Clique-tree, Chordal graphs, Dynamic algorithms, Graph generation
15	William Y. C. Chen, Andreas W. M. Dress, Winking Q. Yu	Community Structures of Networks.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	clique partitioning problem, graph partitioning problem, food webs, Zachary’s karate club, Networks, linear programming, graphs, integer linear programming, community structures
15	Chính T. Hoàng, Marcin Kaminski 0001, Vadim V. Lozin, Joe Sawada, Xiao Shu	A Note on k-Colorability of P5-Free Graphs.	MFCS	2008	DBLP DOI BibTeX RDF	P 5-free graphs, dominating clique, graph coloring
15	Nan Wang, Srinivasan Parthasarathy 0001, Kian-Lee Tan, Anthony K. H. Tung	CSV: visualizing and mining cohesive subgraphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	graph density, data mining, visualization, graph mining, clique
15	Wang-Dauh Tseng	Generation of Primary Input Blocking Pattern for Power Minimization during Scan Testing.	J. Electron. Test.	2007	DBLP DOI BibTeX RDF	transition density, switching activity during test, clique, low power testing, full scan
15	Petr Hlinený, Sang-il Oum	Finding Branch-Decompositions and Rank-Decompositions.	ESA	2007	DBLP DOI BibTeX RDF	Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width
15	Zhanhua Bai, Qiang Lv	A leader-based parallel cross entropy algorithm for MCP.	GECCO (Companion)	2007	DBLP DOI BibTeX RDF	parallel algorithm, cross entropy method, maximum clique problem
15	Gulsah Altun, Hae-Jin Hu, Stefan Gremalschi, Robert W. Harrison, Yi Pan 0001	A Feature Selection Algorithm Based on Graph Theory and Random Forests for Protein Secondary Structure Prediction.	ISBRA	2007	DBLP DOI BibTeX RDF	feature selection, clique, random forests, protein secondary structure prediction
15	Jizhen Zhao, Dongsheng Che, Liming Cai	Comparative Pathway Prediction Via Unified Graph Modeling of Genomic Structure Information.	ISBRA	2007	DBLP DOI BibTeX RDF	Pathway prediction, protein-DNA interaction, operon, independent set, clique, tree decomposition
15	Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie 0002	Testing k-wise and almost k-wise independence.	STOC	2007	DBLP DOI BibTeX RDF	almost k-wise independence, hidden clique, property testing, Fourier analysis, k-wise independence
15	David S. Johnson	The NP-completeness column: The many limits on approximation.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	label cover, Approximation algorithms, lower bounds, set cover, clique, probabilistically checkable proofs, Unique Games Conjecture
15	Damian Watkins, Craig Scott, Darryn Randle	A Graph Alorithm Based Approach to Recovery and Failover in Tactical Manets.	SNPD	2006	DBLP DOI BibTeX RDF	Clique Set Algorithm, Cut Set Algorithm, Mobile Adhoc Networks, Graph Theory, Network Security, Intelligent Agents
15	Virginia Vassilevska, Ryan Williams 0001	Finding a maximum weight triangle in n3-Delta time, with applications.	STOC	2006	DBLP DOI BibTeX RDF	dominating pairs, sub-cubic algorithm, matrix multiplication, independent set, clique, triangle
15	Sándor P. Fekete, Henk Meijer	Maximum Dispersion and Geometric Maximum Weight Cliques.	Algorithmica	2004	DBLP DOI BibTeX RDF	Remote clique, Heaviest subgraph, Approximation, Facility location, PTAS, Geometric optimization, Dispersion, Maximum weight cliques