|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3546 occurrences of 2220 keywords
|
|
|
Results
Found 8751 publication records. Showing 8751 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
79 | Guizhen Yang |
The complexity of mining maximal frequent itemsets and maximal frequent patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, August 22-25, 2004, pp. 344-353, 2004, ACM, 1-58113-888-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
maximal frequent pattern, data mining, complexity, theory, maximal frequent itemset |
68 | Dongyang Long, Weijia Jia 0001 |
Optimal Maximal Encoding Different from Huffman Encoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2001 International Symposium on Information Technology (ITCC 2001), 2-4 April 2001, Las Vegas, NV, USA, pp. 493-, 2001, IEEE Computer Society, 0-7695-1062-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
58 | Xiaohua Hu 0001, Nick Cercone |
Learning Maximal Generalized Decision Rules via Discretization, Generalization, and Rough Set Feature Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 9th International Conference on Tools with Artificial Intelligence, ICTAI '97, Newport Beach, CA, USA, November 3-8, 1997, pp. 548-, 1997, IEEE Computer Society, 0-8186-8203-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
maximal generalized decision rule learning, rough set feature selection, maximal generalized decision rule mining, primitive values, symbolic attributes, high level concepts, identical tuples, predefined concept hierarchy, context sensitive feature merit measure, redundant condition values, maximal generalized decision rules, UCI data sets, market database, learning accuracy, generalization, deductive databases, rough sets theory, discretization, feature space, numeric attributes, attribute value |
58 | Elias Dahlhaus, Marek Karpinski |
A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 139-144, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
56 | Hiroki Arimura, Takeaki Uno |
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(3), pp. 243-262, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Maximal motif, Data mining, Algorithm, Delay, Polynomial time, Pattern discovery, Enumeration, Motif, Sequence mining, Closed pattern, Closed itemset |
55 | Yaorong Ge, J. Michael Fitzpatrick |
Extraction of maximal inscribed disks from discrete Euclidean distance maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96), June 18-20, 1996 San Francisco, CA, USA, pp. 556-561, 1996, IEEE Computer Society, 0-8186-7258-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
maximal inscribed disks, discrete Euclidean distance maps, discrete maximal disks, Euclidean distance metric, axis of symmetry, image processing, computational geometry, skeletons, shape representation, distance metrics |
51 | Tutut Herawan, Iwan Tri Riyadi Yanto, Mustafa Mat Deris |
SMARViz: Soft Maximal Association Rules Visualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IVIC ![In: Visual Informatics: Bridging Research and Practice, First International Visual Informatics Conference, IVIC 2009, Kuala Lumpur, Malaysia, November 11-13, 2009, Proceedings, pp. 664-674, 2009, Springer, 978-3-642-05035-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Maximal association rules, Soft set theory, Data mining, Visualization |
51 | Natwar Modani, Kuntal Dey |
Large maximal cliques enumeration in sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 1377-1378, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
filtering, maximal clique |
50 | Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch |
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph Based Representations in Pattern Recognition, 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003, Proceedings, pp. 24-34, 2003, Springer, 3-540-40452-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
irregular graph pyramids, maximal independent directed edge set, topology preserving contraction, maximal independent set |
47 | Soon M. Chung, Congnan Luo |
Efficient mining of maximal frequent itemsets from databases on a cluster of workstations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 16(3), pp. 359-391, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Scalability, Association rules, Parallel data mining, Maximal frequent itemsets |
47 | Jiayin Feng, Jiadong Ren |
MMFI_DSSW - A New Method to Incrementally Mine Maximal Frequent Itemsets in Transaction Sensitive Sliding Window. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KSEM ![In: Knowledge Science, Engineering and Management, Second International Conference, KSEM 2007, Melbourne, Australia, November 28-30, 2007, Proceedings, pp. 485-495, 2007, Springer, 978-3-540-76718-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algorithm, data streams, maximal frequent itemsets |
47 | Jörg Eisfeld, Leo Storme, Péter Sziklai |
On the Spectrum of the Sizes of Maximal Partial Line Spreads in PG(2n, q), n >= 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 36(1), pp. 101-110, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
maximal partial line spreads, projective spaces |
47 | Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz |
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 8th Pacific-Asia Conference, PAKDD 2004, Sydney, Australia, May 26-28, 2004, Proceedings, pp. 63-73, 2004, Springer, 3-540-22064-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
closed subtree, maximal subtree, enumeration tree, rooted unordered tree, Frequent subtree |
45 | Alessandro Panconesi, Romeo Rizzi |
Some simple distributed algorithms for sparse networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 14(2), pp. 97-100, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Vertex colouring, Edge colouring, Distributed computing, Maximal independent set, Sparse networks, Maximal matching |
45 | Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker |
Matching Hierarchical Structures Using Association Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 21(11), pp. 1105-1120, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Maximal subtree isomorphisms, replicator dynamical systems, shock trees, shape recognition, maximal cliques, association graphs |
45 | Aaron Windsor |
An NC algorithm for finding a maximal acyclic set in a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 145-150, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hypergraph algorithms, maximal acyclic set, maximal forest, graph algorithms, NC algorithms |
45 | Ryuhei Uehara |
A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 333-341, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
the lexicographically first maximal independent set problem, the lexicographically first maximal subgraph problems, Analysis of algorithms, P-completeness, NC algorithms |
43 | Hiroki Arimura, Takeaki Uno |
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 724-737, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Ken Satoh, Takeaki Uno |
Enumerating Maximal Frequent Sets Using Irredundant Dualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 6th International Conference, DS 2003, Sapporo, Japan, October 17-19,2003, Proceedings, pp. 256-268, 2003, Springer, 3-540-20293-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Baruch Awerbuch, Tripurari Singh |
An Online Algorithm for the Dynamic Maximal Dense Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(4), pp. 540-553, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Dense tree, Multicast, Dynamic, Online algorithms |
42 | Bai-En Shie, Vincent S. Tseng, Philip S. Yu |
Online mining of temporal maximal utility itemsets from data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1622-1626, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
maximal itemsets, temporal high utility itemsets, data stream mining, utility mining |
42 | Kenneth A. Berman, Chad Yoshikawa |
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 368-377, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Distributed Flow Algorithms, Maximal Flow, Oblivious Routing, Network Algorithms |
42 | Congnan Luo, Anil L. Pereira, Soon Myoung Chung |
Distributed Mining of Maximal Frequent Itemsets on a Data Grid System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 37(1), pp. 71-90, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scalability, association rules, Data Grid, distributed data mining, maximal frequent itemsets |
42 | Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj |
On Testing Membership to Maximal Consistent Extensions of Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSCTC ![In: Rough Sets and Current Trends in Computing, 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Proceedings, pp. 85-90, 2006, Springer, 3-540-47693-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
maximal consistent extensions, rough sets, information systems |
42 | Yun Chi, Yi Xia, Yirong Yang, Richard R. Muntz |
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(2), pp. 190-202, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
closed frequent subtree, maximal frequent subtree, data mining, Trees, graph algorithms, mining methods and algorithms, frequent subtree |
42 | Roman M. Kolpakov, Gregory Kucherov |
Finding Maximal Repetitions in a Word in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 596-604, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
word combinatorics, maximal repetitions, algorithm, time complexity, periodicities, repetitions |
42 | Luigi P. Cordella, Gabriella Sanniti di Baja |
Geometric Properties of the Union of Maximal Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(2), pp. 214-217, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
maximal neighborhoods, discrete medial axis transform, local maxima, computational geometry, computational geometry, optimisation, computerised picture processing, computerised picture processing, digital images |
40 | Maxime Crochemore, Lucian Ilie |
Analysis of Maximal Repetitions in Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 465-476, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
repetitions in strings, maximal repetitions, maximal periodicities, sum of exponents, runs, Combinatorics on words |
39 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
On Independent Sets and Bicliques in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 171-182, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Hiroki Arimura, Takeaki Uno |
Mining Maximal Flexible Patterns in a Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JSAI ![In: New Frontiers in Artificial Intelligence, JSAI 2007 Conference and Workshops, Miyazaki, Japan, June 18-22, 2007, Revised Selected Papers, pp. 307-317, 2007, Springer, 978-3-540-78196-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | David Linnan Li, Shahriar Shahriari |
Games of Chains and Cutsets in the Boolean Lattice II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(3), pp. 247-267, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Boolean lattice, games on the Boolean lattice, independent chains, maximal chain, width, cutset |
37 | Alioune Ngom, Corina Reischer, Ivan Stojmenovic |
Classification of Functions and Enumeration of Bases of Set Logic under Boolean Compositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 78-85, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
set logic bases enumeration, functions classification, Boolean compositions, r-valued set logic, n-tuples, B-maximal sets, set logic, one-place example function, one-place set logic functions, B-Sheffer functions, Boolean functions, Boolean functions, set theory, multivalued logic |
37 | Tao Li 0008, Zhigang Sun, Wu Jigang, Xicheng Lu |
Fast enumeration of maximal valid subgraphs for custom-instruction identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2009 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2009, Grenoble, France, October 11-16, 2009, pp. 29-36, 2009, ACM. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
ISE identification, custom processors, maximal subgraph |
37 | Shiguang Ju, Chen Chen |
MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIP ![In: International Symposium on Information Processing, ISIP 2008 / International Pacific Workshop on Web Mining, and Web-Based Application, WMWA 2008, Moscow, Russia, 23-25 May 2008, pp. 144-148, 2008, IEEE Computer Society, 978-0-7695-3151-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
data mining, association rules, maximal frequent itemsets |
37 | Gang Quan, Yan Zhang, William Wiles, Pei Pei |
Guaranteed scheduling for repetitive hard real-time tasks under the maximal temperature constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES+ISSS ![In: Proceedings of the 6th International Conference on Hardware/Software Codesign and System Synthesis, CODES+ISSS 2008, Atlanta, GA, USA, October 19-24, 2008, pp. 267-272, 2008, ACM, 978-1-60558-470-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
maximal temperature, real-time scheduling, energy consumption, thermal aware |
37 | Shariq Bashir, Abdul Rauf Baig |
Max-FTP: Mining Maximal Fault-Tolerant Frequent Patterns from Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BNCOD ![In: Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, Glasgow, UK, July 3-5, 2007, Proceedings, pp. 235-246, 2007, Springer, 978-3-540-73389-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Fault Tolerant Frequent Patterns Mining, Maximal Frequent Patterns Mining, Bit-vector Representation and Association Rules |
37 | Chen Wu, Xiaohua Hu 0001, Zhoujun Li 0001, Xiaohua Zhou, Palakorn Achananuparp |
Algorithms for Different Approximations in Incomplete Information Systems with Maximal Compatible Classes as Primitive Granules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GrC ![In: 2007 IEEE International Conference on Granular Computing, GrC 2007, San Jose, California, USA, 2-4 November 2007, pp. 169-174, 2007, IEEE Computer Society, 0-7695-3032-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
rough set model, maximal compatible class, algorithm, incomplete information system |
37 | Haibin Kan, Hong Shen 0001 |
The maximal rates of more general complex orthogonal designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China, pp. 177-180, 2005, IEEE Computer Society, 0-7695-2405-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
complex orthogonal designs, maximal rates, delays, space-time block codes |
37 | Zhou Wang, Hongjian Fan, Kotagiri Ramamohanarao |
Exploiting Maximal Emerging Patterns for Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, December 4-6, 2004, Proceedings, pp. 1062-1068, 2004, Springer, 3-540-24059-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
maximal Emerging Patterns, classification, Emerging Patterns, Bayesian learning |
37 | Detlef Hühnlein, Michael J. Jacobson Jr., Damian Weber |
Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(3), pp. 281-299, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
non-maximal imaginary quadratic order, non-interactive cryptography, discrete logarithm, identity based cryptography |
37 | Chiuyuan Chen |
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(1), pp. 79-86, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximal planar graph, separating triangle, NP-complete, planar graph, hamiltonian cycle |
37 | Soon Myoung Chung, Congnan Luo |
Parallel Mining of Maximal Frequent Itemsets from Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 3-5 November 2003, Sacramento, California, USA, pp. 134-, 2003, IEEE Computer Society, 0-7695-2038-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
scalability, association rules, Parallel data mining, maximal frequent itemsets |
37 | Brett McElwee |
Maximal and Minimal Semilattices on Ordered Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(2), pp. 137-149, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
free, filter, minimal, ideal, semilattice, maximal |
37 | Detlef Hühnlein, Michael J. Jacobson Jr., Damian Weber |
Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings, pp. 275-287, 2000, Springer, 3-540-42069-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
non-maximal imaginary quadratic order, non-interactive cryptography, discrete logarithm, identity based cryptosystem |
36 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
What cannot be computed locally! ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 300-309, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation hardness, distributed algorithms, locality, lower bounds, dominating set, vertex cover, maximal independent set, maximal matching |
36 | James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook |
A Functional Approach to External Graph Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(3), pp. 437-458, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Functional programming, Graph algorithms, Minimum spanning trees, Connected components, External memory algorithms, Maximal independent sets, Maximal matchings |
36 | Bernd S. W. Schröder |
Reconstruction of the Neighborhood Deck of an Ordered Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(3), pp. 255-269, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
maximal card, maximal ideal, N-free, side hair, reconstruction, neighborhood, ordered set, hair |
34 | Hsuan-Shih Lee |
On-Line Association Rules Mining with Dynamic Support. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based Intelligent Information and Engineering Systems, 10th International Conference, KES 2006, Bournemouth, UK, October 9-11, 2006, Proceedings, Part II, pp. 896-901, 2006, Springer, 3-540-46537-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Nan Du, Bin Wu 0001, Liutong Xu, Bai Wang 0001, Pei Xin |
Parallel Algorithm for Enumerating Maximal Cliques in Complex Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mining Complex Data ![In: Mining Complex Data, pp. 207-221, 2009, Springer, 978-3-540-88066-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Nan Du, Bin Wu 0001, Liutong Xu, Bai Wang 0001, Xin Pei |
A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 320-324, 2006, IEEE Computer Society, 0-7695-2702-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Guowu Yang, Jin Yang 0006, Xiaoyu Song, Fei Xie |
Maximal Models of Assertion Graph in GSTE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 684-693, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Lakshmanan Kuppusamy |
End-Marked Maximal Depth-First Contextual Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, pp. 339-350, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Guimei Liu, Kelvin Sim, Jinyan Li 0001 |
Efficient Mining of Large Maximal Bicliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 8th International Conference, DaWaK 2006, Krakow, Poland, September 4-8, 2006, Proceedings., pp. 437-448, 2006, Springer, 3-540-37736-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko |
Maximal Association Rules: A Tool for Mining Associations in Text. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Inf. Syst. ![In: J. Intell. Inf. Syst. 25(3), pp. 333-345, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
data mining, association rules, text mining |
34 | Masaharu Yoshioka, Makoto Haraguchi, Akihito Mizoe |
Towards Constructing Story Databases Using Maximal Analogies Between Stories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets ![In: Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets, International Workshop, Dagstuhl Castle, Germany, March 1-5, 2004, Revised Selected Papers, pp. 243-255, 2004, Springer, 3-540-24465-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Michel Habib, Christophe Paul, Mathieu Raffinot |
Maximal Common Connected Sets of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 359-372, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Soon M. Chung, Congnan Luo |
Distributed mining of maximal frequent itemsets from databases on a cluster of workstations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCGRID ![In: 4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), April 19-22, 2004, Chicago, Illinois, USA, pp. 499-507, 2004, IEEE Computer Society, 0-7803-8430-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Jun Zhao 0005, Fred J. Meyer, Fabrizio Lombardi, Nohpill Park |
Maximal diagnosis of interconnects of random access memories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 52(4), pp. 423-434, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Dongyang Long |
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EurAsia-ICT ![In: EurAsia-ICT 2002: Information and Communication Technology, First EurAsian Conference, Shiraz, Iran, October 29-31, 2002, Proceedings, pp. 127-134, 2002, Springer, 3-540-00028-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Jason Miller, Jacob D. Furst |
The Maximal Scale Ridge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Scale-Space ![In: Scale-Space Theories in Computer Vision, Second International Conference, Scale-Space'99, Corfu, Greece, September 26-27, 1999, Proceedings, pp. 93-104, 1999, Springer, 3-540-66498-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Heike Petermann |
Natural Language Text Processing and the Maximal Join Operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Knowledge Representation as Interlingua, 4th International Conference on Conceptual Structures, ICCS '96, Sydney, Australia, August 19-22, 1996, Proceedings, pp. 100-114, 1996, Springer, 3-540-61534-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
34 | Peter G. Boyvalenkov, Ivan N. Landgev |
On Maximal Spherical Codes I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings, pp. 158-168, 1995, Springer, 3-540-60114-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Pekka Orponen, David A. Russo, Uwe Schöning |
Polynomial Levelability and Maximal Complexity Cores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings, pp. 435-444, 1985, Springer, 3-540-15650-X. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
32 | Benny Kimelfeld, Yehoshua Sagiv |
Maximally joining probabilistic data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 303-312, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
maximal answers, query-and-data complexity, probabilistic databases, natural join |
32 | Xuan Li, Lunjin Lu |
Inverting abstract unification for set-sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 11-13 2005, Lisbon, Portugal, pp. 129-138, 2005, ACM, 1-59593-090-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
maximal models and Boolean formulas, set-sharing, logic programs, backward analysis |
32 | James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu |
Finding maximal cliques in massive networks by H*-graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 447-458, 2010, ACM, 978-1-4503-0032-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
h*-graph, massive networks, maximal clique enumeration, scale-free networks, h-index |
32 | Pei-Yi Hao, Jung-Hsien Chiang, Yen-Hsiu Lin |
A new maximal-margin spherical-structured multi-class support vector machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 30(2), pp. 98-111, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Spherical classifier, Maximal-margin classifier, Support vector machines (SVMs), Quadratic programming, Multi-class classification |
32 | Lakshmanan Kuppusamy, Kamala Krithivasan |
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings, pp. 246-260, 2009, Springer, 978-3-642-03465-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
internal contextual grammars, maximal, incomparable, depth-first |
32 | William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova |
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD Workshop on Knowledge Discovery from Uncertain Data ![In: Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data, Paris, France, June 28, 2009, pp. 48-56, 2009, ACM, 978-1-60558-675-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
graph perturbation theory, maximal clique enumeration, graph algorithms, biological applications |
32 | Andreas Weiermann |
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 488-498, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
well-partial orderings, maximal order types, finite multisets, well-quasi orderings, ordinals, term orderings |
32 | Mohammad-Hossein Nadimi-Shahraki, Norwati Mustapha, Md Nasir Sulaiman, Ali B. Mamat |
PC_Tree: Prime-Based and Compressed Tree for Maximal Frequent Patterns Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
World Congress on Engineering (Selected Papers) ![In: Advances in Electrical Engineering and Computational Science, [revised and extended papers from the World Congress on Engineering, WCE 2008, London, UK, July 2-4, 2008], pp. 495-504, 2008, Springer, 978-90-481-2310-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Maximal frequent pattern, database encoding, frequent pattern, prime number |
32 | Liron Yedidsion, Dvir Shabtay, Moshe Kaspi |
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 10(6), pp. 341-352, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bicriteria, Convex resource allocation, Maximal lateness, Single machine scheduling |
32 | Fujiang Ao, Yuejin Yan, Jian Huang, Kedi Huang |
Mining Maximal Frequent Itemsets in Data Streams Based on FP-Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, 5th International Conference, MLDM 2007, Leipzig, Germany, July 18-20, 2007, Proceedings, pp. 479-489, 2007, Springer, 978-3-540-73498-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
pruning technique, data streams, FP-Tree, maximal frequent itemsets |
32 | Yijun Bei, Gang Chen 0001, Jinxiang Dong |
Improving XML Querying with Maximal Frequent Query Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2007, 7th International Conference Beijing, China, May 27-30, 2007, Proceedings, Part I, pp. 261-269, 2007, Springer, 978-3-540-72583-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Ming, Maximal Frequent Pattern, Caching, XML Query |
32 | Choudhury A. Al Sayeed, Ashraf Matrawy |
Guaranteed Maximal Matching for Input Buffered Crossbar Switches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CNSR ![In: Fourth Annual Conference on Communication Networks and Services Research (CNSR 2006), 24-25 May 2006, Moncton, New Brunswick, Canada, pp. 213-220, 2006, IEEE Computer Society, 0-7695-2578-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Guaranteed maximal matching, iSLIP, MWM, scheduling, perfect matching, crossbar switches |
32 | Dechang Chen, Xilong Mao, Xia Fei, Kai Xing, Fang Liu 0025, Min Song 0002 |
A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit-Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WASA ![In: Wireless Algorithms, Systems, and Applications, First International Conference, WASA 2006, Xi'an, China, August 15-17, 2006, Proceedings, pp. 363-370, 2006, Springer, 3-540-37189-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Ad hoc and sensor networks, connected dominating set, maximal independent set |
32 | Xue-Mei Bai, Jinji Li, Dong-Il Kim, Jong-Hyeok Lee |
Identification of Maximal-Length Noun Phrases Based on Expanded Chunks and Classified Punctuations in Chinese. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCPOL ![In: Computer Processing of Oriental Languages. Beyond the Orient: The Research Challenges Ahead, 21st International Conference, ICCPOL 2006, Singapore, December 17-19, 2006, Proceedings, pp. 268-276, 2006, Springer, 3-540-49667-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Maximal-Length Noun Phrase (MNP), Expanded Chunk, Classified Punctuation |
32 | Karam Gouda, Mohammed Javeed Zaki |
GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 11(3), pp. 223-242, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
maximal itemsets, data mining, association rules, frequent itemsets, backtracking search |
32 | Hui Wang, Qing-Hua Li, Huanyu Xiong, Shengyi Jiang |
Mining Maximal Frequent Itemsets for Intrusion Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GCC Workshops ![In: Grid and Cooperative Computing - GCC 2004 Workshops: GCC 2004 International Workshops, IGKG, SGT, GISS, AAC-GEVO, and VVS, Wuhan, China, October 21-24, 2004. Proceedings, pp. 422-429, 2004, Springer, 3-540-23578-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
data mining, intrusion detection, maximal frequent itemset |
32 | Ji-Cherng Lin, Tetz C. Huang |
An Efficient Fault-Containing Self-Stabilizing Algorithm for Finding a Maximal Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(8), pp. 742-754, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Central demon, single transient fault, restrictions on guard conditions, primary variables, auxiliary secondary variables, stabilization time, contamination number, maximal independent set, fault-containment |
32 | Ryuhei Uehara |
Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 23-25 June 1999, Fremantle, Australia, pp. 350-355, 1999, IEEE Computer Society, 0-7695-0231-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
the lexicographically first maximal subgraph problems, threshold function of a random graph, Analysis of algorithms, P-completeness, NC algorithms |
32 | Afonso Ferreira, Nicolas Schabanel |
A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 23-25 June 1999, Fremantle, Australia, pp. 284-289, 1999, IEEE Computer Society, 0-7695-0231-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Coarse-Grained Models, p-quantiles Search, Parallel Algorithms, Randomized Algorithms, Sorting, Graph Algorithms, Maximal Independent Set, BSP, CGM |
32 | Radu Horaud, Thomas Skordas |
Stereo Correspondence Through Feature Grouping and Maximal Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(11), pp. 1168-1180, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
image structure extraction, feature grouping, relational graph, pattern recognition, pattern recognition, segmentation, graph theory, graph theory, picture processing, picture processing, stereo matching, nodes, stereo correspondence, maximal cliques |
29 | Grégory Duby |
Automorphisms with only infinite orbits on non-algebraic elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(5), pp. 435-447, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Yida Wang 0002, Ee-Peng Lim, San-Yih Hwang |
Efficient algorithms for mining maximal valid groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 17(3), pp. 515-535, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Ghazi Al-Naymat |
Enumeration of maximal clique for mining spatial co-location patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: The 6th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2008, Doha, Qatar, March 31 - April 4, 2008, pp. 126-133, 2008, IEEE Computer Society, 978-1-4244-1967-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Jinyan Li 0001, Guimei Liu, Haiquan Li, Limsoon Wong |
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 19(12), pp. 1625-1637, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Graph algorithms, Mining methods and algorithms |
29 | Hiroki Arimura, Takeaki Uno, Shinichi Shimozono |
Time and Space Efficient Discovery of Maximal Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 10th International Conference, DS 2007, Sendai, Japan, October 1-4, 2007, Proceedings, pp. 42-55, 2007, Springer, 978-3-540-75487-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
closed graph mining, rightmost expansion, polynomial delay polynomial space enumeration algorithms, depth-first search, geometric graphs |
29 | Gerth Stølting Brodal, Allan Grønlund Jørgensen |
A Linear Time Algorithm for the k Maximal Sums Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 442-453, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Bo Liu 0062, Jiuhui Pan |
A Graph-Based Algorithm for Mining Maximal Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (3) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 3, pp. 263-267, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Bin Wu 0001, Xin Pei |
A Parallel Algorithm for Enumerating All the Maximal k -Plexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD Workshops ![In: Emerging Technologies in Knowledge Discovery and Data Mining, PAKDD 2007, International Workshops, Nanjing, China, May 22-25, 2007, Revised Selected Papers, pp. 476-483, 2007, Springer, 978-3-540-77016-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001, Katarzyna E. Paluch 0001 |
Rank-maximal matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(4), pp. 602-610, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
maximum cardinality matching, one-sided preference lists, Bipartite matching |
29 | Hai Liu 0001, Peng-Jun Wan, Xiaohua Jia |
Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 17(12), pp. 1526-1536, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scheduling, sensor network, Energy efficiency, lifetime, surveillance system |
29 | Kelvin Sim, Jinyan Li 0001, Vivekanand Gopalkrishnan, Guimei Liu |
Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 1059-1063, 2006, IEEE Computer Society, 0-7695-2701-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Ronnie Alves, Orlando Belo |
On the Computation of Maximal-Correlated Cuboids Cells. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 8th International Conference, DaWaK 2006, Krakow, Poland, September 4-8, 2006, Proceedings., pp. 165-174, 2006, Springer, 3-540-37736-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Haibin Kan, Hong Shen 0001 |
A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(1), pp. 355-359, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Hai Liu 0001, Peng-Jun Wan, Chih-Wei Yi, Xiaohua Jia, S. A. M. Makki, Niki Pissinou |
Maximal lifetime scheduling in sensor surveillance networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA, pp. 2482-2491, 2005, IEEE, 0-7803-8968-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan |
Online Mining (Recently) Maximal Frequent Itemsets over Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RIDE ![In: 15th International Workshop on Research Issues in Data Engineering (RIDE-SDMA 2005), Stream Data Mining and Applications, 3-7 April 2005, Tokyo, Japan, pp. 11-18, 2005, IEEE Computer Society, 0-7695-2390-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Kazuhisa Makino, Takeaki Uno |
New Algorithms for Enumerating All Maximal Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 260-272, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Matthias Hein 0001, Olivier Bousquet |
Maximal Margin Classification for Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedings, pp. 72-86, 2003, Springer, 3-540-40720-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 8751 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|