|
|
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. |
KDD |
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. |
ITCC |
2001 |
DBLP DOI BibTeX RDF |
|
58 | Xiaohua Hu 0001, Nick Cercone |
Learning Maximal Generalized Decision Rules via Discretization, Generalization, and Rough Set Feature Selection. |
ICTAI |
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). |
SWAT |
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. |
J. Comb. Optim. |
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. |
CVPR |
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. |
IVIC |
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. |
CIKM |
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. |
GbRPR |
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. |
Knowl. Inf. Syst. |
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. |
KSEM |
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. |
Des. Codes Cryptogr. |
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. |
PAKDD |
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. |
Distributed Comput. |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
SPAA |
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. |
WG |
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. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Ken Satoh, Takeaki Uno |
Enumerating Maximal Frequent Sets Using Irredundant Dualization. |
Discovery Science |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Baruch Awerbuch, Tripurari Singh |
An Online Algorithm for the Dynamic Maximal Dense Tree Problem. |
Algorithmica |
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. |
SAC |
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. |
COCOON |
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. |
J. Supercomput. |
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. |
RSCTC |
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. |
IEEE Trans. Knowl. Data Eng. |
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. |
FOCS |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
MFCS |
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. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Hiroki Arimura, Takeaki Uno |
Mining Maximal Flexible Patterns in a Sequence. |
JSAI |
2007 |
DBLP DOI BibTeX RDF |
|
37 | David Linnan Li, Shahriar Shahriari |
Games of Chains and Cutsets in the Boolean Lattice II. |
Order |
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. |
ISMVL |
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. |
CASES |
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. |
ISIP |
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. |
CODES+ISSS |
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. |
BNCOD |
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. |
GrC |
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. |
PDCAT |
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. |
Australian Conference on Artificial Intelligence |
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. |
Des. Codes Cryptogr. |
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. |
J. Comb. Optim. |
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. |
ICTAI |
2003 |
DBLP DOI BibTeX RDF |
scalability, association rules, Parallel data mining, maximal frequent itemsets |
37 | Brett McElwee |
Maximal and Minimal Semilattices on Ordered Sets. |
Order |
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. |
Selected Areas in Cryptography |
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! |
PODC |
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. |
Algorithmica |
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. |
Order |
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. |
KES (2) |
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. |
Mining Complex Data |
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. |
ICDM Workshops |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Guowu Yang, Jin Yang 0006, Xiaoyu Song, Fei Xie |
Maximal Models of Assertion Graph in GSTE. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Lakshmanan Kuppusamy |
End-Marked Maximal Depth-First Contextual Grammars. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Guimei Liu, Kelvin Sim, Jinyan Li 0001 |
Efficient Mining of Large Maximal Bicliques. |
DaWaK |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko |
Maximal Association Rules: A Tool for Mining Associations in Text. |
J. Intell. Inf. Syst. |
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. |
Intuitive Human Interfaces for Organizing and Accessing Intellectual Assets |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Michel Habib, Christophe Paul, Mathieu Raffinot |
Maximal Common Connected Sets of Interval Graphs. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Soon M. Chung, Congnan Luo |
Distributed mining of maximal frequent itemsets from databases on a cluster of workstations. |
CCGRID |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Jun Zhao 0005, Fred J. Meyer, Fabrizio Lombardi, Nohpill Park |
Maximal diagnosis of interconnects of random access memories. |
IEEE Trans. Reliab. |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Dongyang Long |
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme. |
EurAsia-ICT |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Jason Miller, Jacob D. Furst |
The Maximal Scale Ridge. |
Scale-Space |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Heike Petermann |
Natural Language Text Processing and the Maximal Join Operator. |
ICCS |
1996 |
DBLP DOI BibTeX RDF |
|
34 | Peter G. Boyvalenkov, Ivan N. Landgev |
On Maximal Spherical Codes I. |
AAECC |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Pekka Orponen, David A. Russo, Uwe Schöning |
Polynomial Levelability and Maximal Complexity Cores. |
ICALP |
1985 |
DBLP DOI BibTeX RDF |
|
32 | Benny Kimelfeld, Yehoshua Sagiv |
Maximally joining probabilistic data. |
PODS |
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. |
PPDP |
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. |
SIGMOD Conference |
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. |
Appl. Intell. |
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. |
ICTAC |
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. |
KDD Workshop on Knowledge Discovery from Uncertain Data |
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. |
CiE |
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. |
World Congress on Engineering (Selected Papers) |
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. |
J. Sched. |
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. |
MLDM |
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. |
International Conference on Computational Science (1) |
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. |
CNSR |
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. |
WASA |
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. |
ICCPOL |
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. |
Data Min. Knowl. Discov. |
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. |
GCC Workshops |
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. |
IEEE Trans. Parallel Distributed Syst. |
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. |
ISPAN |
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. |
ISPAN |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
Arch. Math. Log. |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Yida Wang 0002, Ee-Peng Lim, San-Yih Hwang |
Efficient algorithms for mining maximal valid groups. |
VLDB J. |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Ghazi Al-Naymat |
Enumeration of maximal clique for mining spatial co-location patterns. |
AICCSA |
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. |
IEEE Trans. Knowl. Data Eng. |
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. |
Discovery Science |
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. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Bo Liu 0062, Jiuhui Pan |
A Graph-Based Algorithm for Mining Maximal Frequent Itemsets. |
FSKD (3) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Bin Wu 0001, Xin Pei |
A Parallel Algorithm for Enumerating All the Maximal k -Plexes. |
PAKDD Workshops |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001, Katarzyna E. Paluch 0001 |
Rank-maximal matchings. |
ACM Trans. Algorithms |
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. |
IEEE Trans. Parallel Distributed Syst. |
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. |
ICDM |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Ronnie Alves, Orlando Belo |
On the Computation of Maximal-Correlated Cuboids Cells. |
DaWaK |
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. |
IEEE Trans. Inf. Theory |
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. |
INFOCOM |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan |
Online Mining (Recently) Maximal Frequent Itemsets over Data Streams. |
RIDE |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Kazuhisa Makino, Takeaki Uno |
New Algorithms for Enumerating All Maximal Cliques. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Matthias Hein 0001, Olivier Bousquet |
Maximal Margin Classification for Metric Spaces. |
COLT |
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][ >>] |
|