|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15280 occurrences of 6018 keywords
|
|
|
Results
Found 32431 publication records. Showing 32431 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
48 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee |
Two Variations of the Minimum Steiner Problem. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time |
44 | Guillaume Fertin, André Raspaud |
Families of Graphs Having Broadcasting and Gossiping Properties. |
WG |
1998 |
DBLP DOI BibTeX RDF |
minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs |
43 | Dae-Young Seo, D. T. Lee, Tien-Ching Lin |
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
41 | Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida |
A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure |
41 | Shailender Chaudhry, Alok N. Choudhary |
Time dependent priority scheduling for guaranteed QoS systems. |
ICCCN |
1997 |
DBLP DOI BibTeX RDF |
time dependent priority scheduling, guaranteed QoS systems, isochronous data transmission, minimum bandwidth, minimum packet delay, minimum delay jitter, minimum loss, input traffic characterization, scheduling, admission control, packet switching, multimedia applications, B-ISDN, service guarantees, schedulability condition |
38 | Jen-Wei Kuo, Hsin-Min Wang |
A Minimum Boundary Error Framework for Automatic Phonetic Segmentation. |
ISCSLP |
2006 |
DBLP DOI BibTeX RDF |
automatic phonetic segmentation, minimum boundary error, minimum Bayes risk, discriminative training |
36 | Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du |
Grade of Service Steiner Minimum Trees in the Euclidean Plane. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Grade of service Steiner minimum trees, k -Optimal heuristic, Approximation algorithms, Communication networks, Transportation networks, Interior-point algorithms |
36 | David R. Karger, Clifford Stein 0001 |
A New Approach to the Minimum Cut Problem. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
parallel computing, randomized algorithm, graph algorithm, network reliability, minimum cut |
36 | Josep Freixas, Xavier Molinero |
On the existence of a minimum integer representation for weighted voting systems. |
Ann. Oper. Res. |
2009 |
DBLP DOI BibTeX RDF |
Minimal realizations, Minimum realization, Realizations with minimum sum, Weighted voting games, Simple games |
36 | Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Schulte, Hui Xiong 0001 |
The minimum consistent subset cover problem and its applications in data mining. |
KDD |
2007 |
DBLP DOI BibTeX RDF |
converse k-clustering, minimum consistent subset cover, minimum rule set, pattern summarization |
36 | Refael Hassin, Asaf Levin |
An Approximation Algorithm for the Minimum Latency Set Cover Problem. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
Minimum sum set cover, minimum latency, approximation algorithm |
36 | Sanjeet Singh, Pankaj Gupta, Davinder Bhatia |
On Multiparametric Sensitivity Analysis in Minimum Cost Network Flow Problem. |
ICCSA (4) |
2005 |
DBLP DOI BibTeX RDF |
multicommodity minimum cost network flow, multiparametric sensitivity analysis, tolerance approach, parametric analysis, Minimum cost network flow |
35 | R. Ravi 0001 |
Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract) |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
minimum gossip time problem, rapid rumor ramification, minimum broadcast time approximation, minimum broadcast time problem, telephone model, multicast problem, NP-complete, NP-hard, undirected graph, conference calls |
35 | Hans L. Bodlaender, Babette van Antwerpen-de Fluiter |
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure |
33 | Stefan Porschen |
Counting All Solutions of Minimum Weight Exact Satisfiability. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
Minimum weight exact satisfiability, minimum weight set partition, counting problem, maximum weight independent set |
33 | Stefan Porschen |
Solving Minimum Weight Exact Satisfiability in Time O(20.2441n). |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
minimum weight exact satisfiability, branching tree, minimum perfect matching, NP-completeness, exact algorithm |
33 | Sang-Joong Lee |
Minimum Cost Operation Mode and Minimum Loss Operation Mode of Power System - Operation Mode Selection Based on Voltage Stability. |
KES (3) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Joon Shik Kim, Jong Chan Kim, Jangmin O, Byoung-Tak Zhang |
A Global Minimization Algorithm Based on a Geodesic of a Lagrangian Formulation of Newtonian Dynamics. |
Neural Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
Adaptively damped oscillator, Adaptive steepest descent, Global minimum search, Heavy ball with friction, Geodesic |
32 | Yunnan Wu, Philip A. Chou, Sun-Yuan Kung |
Minimum-energy multicast in mobile ad hoc networks using network coding. |
IEEE Trans. Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Convex integer programming, Total unimodularity, Network flow, Minimum cut, Nonlinear integer programming |
31 | Pierre Fraigniaud |
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
Minimum Degree Spanning Tree, Approximation Algorithms, Multicasting, Broadcasting, Gossiping, Graph and Network Algorithms |
31 | Petrica C. Pop |
On the prize-collecting generalized minimum spanning tree problem. |
Ann. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
Generalized minimum spanning tree problem, Combinatorial optimization, Minimum spanning trees, Linear relaxation |
31 | Farshid Golchin, Kuldip K. Paliwal |
Minimum-Entropy Clustering and its Application to Lossless Image Coding. |
ICIP (2) |
1997 |
DBLP DOI BibTeX RDF |
lossless image coding, minimum-entropy clustering, discrete source, minimum entropy criterion, classified vector quantization, MEC algorithm, predictive image coder, correlated DPCM image, samples, image coding, entropy coding |
31 | Fengrong Ren, Hiroshi Tanaka, Noria Fukuda, Takashi Gojobori |
Molecular evolutionary phylogenetic trees based on minimum description length principle. |
HICSS (5) |
1995 |
DBLP DOI BibTeX RDF |
molecular evolutionary phylogenetic trees, minimum complexity phylogenetic tree, branch lengths, logarithmic likelihood, mitochondrial DNA sequences, complexity, trees (mathematics), inference mechanisms, DNA, genetics, biology computing, inductive inference, minimum description length principle, tree topology |
29 | R. Uday Kiran, P. Krishna Reddy |
Mining periodic-frequent patterns with maximum items' support constraints. |
Bangalore Compute Conf. |
2010 |
DBLP DOI BibTeX RDF |
maximum constraint model, minimum constraint model, multiple minimum supports, periodic-frequent patterns |
29 | Mathieu Bouchard, Alain Hertz, Guy Desaulniers |
Lower bounds and a tabu search algorithm for the minimum deficiency problem. |
J. Comb. Optim. |
2009 |
DBLP DOI BibTeX RDF |
Minimum deficiency problem, Tabu search, Edge coloring |
29 | Qi Cheng 0001, Daqing Wan |
A deterministic reduction for the gap minimum distance problem: [extended abstract]. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
minimum distance problem, approximation algorithm, NP-complete, coding theory |
29 | Seth Pettie, Vijaya Ramachandran |
Randomized minimum spanning tree algorithms using exponentially fewer random bits. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Graph algorithms, minimum spanning trees, random sampling |
29 | Xieping Gao, Chunhong Cao |
Minimum-energy wavelet frame on the interval. |
Sci. China Ser. F Inf. Sci. |
2008 |
DBLP DOI BibTeX RDF |
wavelet on the interval, frame, multi-resolution analysis, scaling function, minimum-energy |
29 | Guoliang Xue, Wei Xiao |
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Minimum cost delay-constrained network under a Steiner topology, Quality of service, Computer communications, Fully polynomial time approximation scheme |
29 | Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin |
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. |
Ann. Oper. Res. |
2004 |
DBLP DOI BibTeX RDF |
minimum weight vertex cover, meta-heuristic algorithm, ant colony optimization |
28 | Seunghwa Kang, David A. Bader |
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs. |
PPoPP |
2009 |
DBLP DOI BibTeX RDF |
minimum spanning forest, transactional memory, minimum spanning tree |
28 | Moonseong Kim, Minseok Kang, Hyunseung Choo, Jong S. Yang, Young-Cheol Bang |
On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees. |
International Conference on Computational Science (3) |
2007 |
DBLP DOI BibTeX RDF |
Group Multicast Routing Algorithm, Minimum Steiner Trees, Group KMB (GKMB) Algorithm and Minimum Cost Multicast Tree (MCMT) Algorithm |
28 | Ligang Ke, Michael W. Marcellin |
Near-lossless image compression: minimum-entropy, constrained-error DPCM. |
ICIP |
1995 |
DBLP DOI BibTeX RDF |
minimum entropy methods, differential pulse code modulation, trellis coded modulation, near-lossless image compression, minimum-entropy, constrained-error DPCM, quantized prediction error sequence, gray level error, trellises, conditioning prediction error model, algorithm, contexts, data compression, image coding, entropy codes, prediction theory |
27 | Bing Yang 0001, Mei Yang, Jianping Wang 0001, S. Q. Zheng 0001 |
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications. |
ISPAN |
2005 |
DBLP DOI BibTeX RDF |
algorithm, reliability, complexity, Networks, graph, shortest path, survivability, network flow, protection, disjoint paths, minimum cost network flow |
27 | Jun Du, Peng Liu 0001, Frank K. Soong, Jian-Lai Zhou, Ren-Hua Wang |
Noisy Speech Recognition Performance of Discriminative HMMs. |
ISCSLP |
2006 |
DBLP DOI BibTeX RDF |
Minimum Divergence, Minimum Word Error, Noise Robustness, Discriminative Training |
27 | Heinz Hügli, Christian Schütz |
Geometric Matching of 3-D Objects: Assessing the Range of Successful Initial Configurations. |
3DIM |
1997 |
DBLP DOI BibTeX RDF |
3D object geometric matching, rigid object configuration, optimum matching, SIC-range, object recognition, convergence, image matching, experimental results, global minimum, image correspondence, local minimum, iterative closest point algorithm |
27 | Sasan Iman, Massoud Pedram |
Two-level logic minimization for low power. |
ICCAD |
1995 |
DBLP DOI BibTeX RDF |
Power Prime Implicants, low power two-level logic minimization, minimum covering problem, minimum power solution, static CMOS circuits, logic design, logic CAD, integrated circuit design, CMOS logic circuits, circuit CAD, circuit optimisation, minimisation of switching nets |
27 | Kamal Kumar Jain, V. Rajaraman |
Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
lower time bound, upper time bound, multiprocessor optimal schedules, minimum processing time, directed acyclic task graph, worst case behavior, minimum processor number, randomly generated dense task graphs, scheduling, performance evaluation, parallel algorithms, parallel processing, directed graphs, minimisation |
26 | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh |
Compacting cuts: A new linear formulation for minimum cut. |
ACM Trans. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Linear programming formulation complexity, minimum cut problem |
26 | Jung-Eun Kim, Junghee Han, Chang-Gun Lee |
Optimal 3-Coverage with Minimum Separation Requirements for Ubiquitous Computing Environments. |
Mob. Networks Appl. |
2009 |
DBLP DOI BibTeX RDF |
3-coverage, minimum separation requirement, ubiquitous computing, sensor placement |
26 | Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr 0001 |
Traversing a Set of Points with a Minimum Number of Turns. |
Discret. Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
Minimum link spanning path, Approximation algorithms, Computational geometry |
26 | Shichao Zhang 0001, Xindong Wu 0001, Chengqi Zhang, Jingli Lu |
Computing the minimum-support for mining frequent patterns. |
Knowl. Inf. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Minimum support, Data mining, Association rules, Frequent patterns |
26 | Nelson Antunes, Gonçalo Jacinto, António Pacheco 0001 |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks. |
Telecommun. Syst. |
2008 |
DBLP DOI BibTeX RDF |
One-dimensional ad hoc network, Connectivity probability, Minimum hop count, Poisson randomization |
26 | Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman 0001 |
Upward Drawings of Trees on the Minimum Number of Layers. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
Planar Drawing, k-layer Planar Drawing, Upward Drawing, Minimum Layer Upward Drawing, Algorithm, Trees, Line-labeling, Straight-line Drawing |
26 | Keen-Mun Yong, Gee-Swee Poo, Tee-Hiang Cheng |
Efficient Heuristic for Minimum Cost Trees Construction in Multi-Groups Multicast. |
Networking |
2008 |
DBLP DOI BibTeX RDF |
Multi-groups, Minimum cost tree, Multicast, Shared-Tree |
26 | Jung-Eun Kim, Man-Ki Yoon, Junghee Han, Chang-Gun Lee |
Sensor Placement for 3-Coverage with Minimum Separation Requirements. |
DCOSS |
2008 |
DBLP DOI BibTeX RDF |
3-coverage, minimum separation requirement, coverage redundancy, sensor placement |
26 | Frank Neumann 0001, Joachim Reichel, Martin Skutella |
Computing minimum cuts by randomized search heuristics. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
minimum s-t-cuts, evolutionary algorithms, multi-objective optimization, randomized search heuristics |
26 | Chong Hui Kim, Byung Kook Kim |
Minimum-Energy Translational Trajectory Generation for Differential-Driven Wheeled Mobile Robots. |
J. Intell. Robotic Syst. |
2007 |
DBLP DOI BibTeX RDF |
DC motor actuators, Differential-driven wheeled mobile robot, Minimum-energy control, Optimal control theory, Optimal trajectory |
26 | Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr 0001 |
Traversing a set of points with a minimum number of turns. |
SCG |
2007 |
DBLP DOI BibTeX RDF |
minimum link spanning path, approximation algorithms, computational geometry |
26 | Ioannis Papadimitriou, Leonidas Georgiadis |
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree. |
Mob. Networks Appl. |
2006 |
DBLP DOI BibTeX RDF |
minimum-energy broadcast, approximation algorithms, wireless networks, performance analysis, spanning trees |
26 | Guoliang Xing, Chenyang Lu 0001, Ying Zhang 0048, Qingfeng Huang, Robert Pless |
Minimum power configuration in wireless sensor networks. |
MobiHoc |
2005 |
DBLP DOI BibTeX RDF |
minimum power configuration, sensor networks, ad-hoc networks, energy efficiency, wireless communications |
26 | Hovhannes A. Harutyunyan, Calin D. Morosan |
On Two Properties of the Minimum Broadcast Time Function. |
IV |
2005 |
DBLP DOI BibTeX RDF |
minimum broadcast time, broadcast function, maximum diameter, broadcasting |
26 | Hans L. Bodlaender, Udi Rotics |
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
minimum fill-in, minimal separators, graph algorithms, treewidth, Algorithms and data structures, modular decomposition |
26 | Seth Pettie, Vijaya Ramachandran |
An Optimal Minimum Spanning Tree Algorithm. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
optimal complexity, Graph algorithms, minimum spanning tree |
26 | Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang |
Triangulations without Minimum-Weight Drawing. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
Graph drawing, Minimum-weight triangulation |
26 | Irith Pomeranz, Zvi Kohavi |
The minimum test set problem for circuits with nonreconvergent fanout. |
J. Electron. Test. |
1991 |
DBLP DOI BibTeX RDF |
minimum test set size problem, nonreconvergent fanout circuits, restricted fanout circuits, Labeling algorithms |
25 | Stefan Voß 0001 |
Capacitated Minimum Spanning Trees. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Capacitated minimum spanning tree problem, Terminal layout problem, Resource-constrained minimum spanning tree problem, Combinatorial optimization, Telecommunication, Spanning tree |
25 | Ming-Cai Zheng, Da-Fang Zhang, Jian Luo |
Minimum Hop Routing Wireless Sensor Networks Based on Ensuring of Data Link Reliability. |
MSN |
2009 |
DBLP DOI BibTeX RDF |
minimum hop routing, minimum hop gradient field, link reliability, stable period, wireless sensor networks |
25 | Heinz Mühlenbein, Robin Höns |
Approximate factorizations of distributions and the minimum relative entropy principle. |
GECCO Workshops |
2005 |
DBLP DOI BibTeX RDF |
bethe-kikuchi approximation, boltzmann distribution, factorization of distributions, minimum log-likelihood ratio, minimum relative entropy, maximum entropy principle, bayesian information criterion, estimation of distributions |
25 | Naveen Garg 0001 |
A 3-Approximation for the Minimum Tree Spanning k Vertices. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
minimum tree, 3-approximation, k-vertices, minimum tour, spanning k vertices, graph, trees (mathematics) |
25 | Juan A. Garay, Shay Kutten, David Peleg |
A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
distributed minimum-weight spanning tree algorithm, sublinear time distributed algorithm, minimum-weight spanning trees, global network problems, n-vertex network, Diam, edge elimination techniques, time complexity, graph decomposition |
25 | Pankaj K. Agarwal, David Eppstein, Jirí Matousek 0001 |
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
Euclidean minimum spanning tree, half-space range reporting, minima, decomposable function, closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, minimum spanning trees, diameter, dynamic data structures, geometric optimization, geometric problems |
25 | Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz |
The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. |
IEEE Trans. Computers |
1989 |
DBLP DOI BibTeX RDF |
minimum test sets, monotone combinational circuits, minimum complete test set, monotone PLAs, computational complexity, complexity, logic testing, NP-complete, logic arrays, combinatorial circuits, literals |
25 | Juhani Nieminen |
A New Method of Formulating a Minimum Edge Set. |
IEEE Trans. Computers |
1975 |
DBLP DOI BibTeX RDF |
minimum coverng, minimum number of test points, one distinguishability, Directed graphs, fault location |
25 | David Bol, Renaud Ambroise, Denis Flandre, Jean-Didier Legat |
Analysis and minimization of practical energy in 45nm subthreshold logic circuits. |
ICCD |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Edward Omiecinski |
Alternative Interest Measures for Mining Associations in Databases. |
IEEE Trans. Knowl. Data Eng. |
2003 |
DBLP DOI BibTeX RDF |
interest measures, Data mining, performance, databases, associations |
25 | Jens Bleiholder, Sascha Szott, Melanie Herschel, Frank Kaufer, Felix Naumann |
Subsumption and complementation as data fusion operators. |
EDBT |
2010 |
DBLP DOI BibTeX RDF |
complement union, minimum union, data integration, data quality |
25 | Telikepalli Kavitha, Katakam Vamsi Krishna |
An improved heuristic for computing short integral cycle bases. |
ACM J. Exp. Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
integral cycle basis, minimum cycle basis, combinatorial optimization, Directed graph |
25 | Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth |
Extremal problems on triangle areas in two and three dimensions. |
SCG |
2008 |
DBLP DOI BibTeX RDF |
distinct triangle areas, extremal combinatorics, maximum triangle areas, minimum triangle areas, unit triangle areas, discrete geometry, point configurations |
24 | Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito |
An improved constant-time approximation algorithm for maximum matchings. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
24 | Xunkai Wei, Ying-Hong Li 0003, Yufei Li, Dong-Fang Zhang |
Enclosing machine learning: concepts and algorithms. |
Neural Comput. Appl. |
2008 |
DBLP DOI BibTeX RDF |
Enclosing machine learning, Minimum volume enclosing shapes, Minimum volume enclosing ellipsoid, Cognitive class description, Cognitive class recognizing, Cognitive process |
24 | Miroslav Chlebík, Janka Chlebíková |
Approximation hardness of edge dominating set problems. |
J. Comb. Optim. |
2006 |
DBLP DOI BibTeX RDF |
Minimum edge dominating set, Minimum maximal matching, Approximation lower bound, Everywhere dense graphs, Bounded degree graphs |
24 | Van-Ban Le, D. T. Lee |
Out-of-Roundness Problem Revisited. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1991 |
DBLP DOI BibTeX RDF |
minimum area difference centre, minimum radial separation, out-of-roundness, farthest-neighbor Voronoi diagram, computational geometry, computational geometry, polygon, medial axis, intersection points |
24 | Mingyu Xiao 0001 |
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
k-Way Cut, Graph Algorithm, Divide-and-Conquer |
24 | Telikepalli Kavitha, Kurt Mehlhorn |
Algorithms to Compute Minimum Cycle Basis in Directed Graphs. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Yeong-Chyi Lee, Tzung-Pei Hong, Tien-Chin Wang |
Mining Multiple-Level Association Rules Under the Maximum Constraint of Multiple Minimum Supports. |
IEA/AIE |
2006 |
DBLP DOI BibTeX RDF |
|
24 | William J. Lenhart, Giuseppe Liotta |
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). |
GD |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Jan Remy, Angelika Steger |
A quasi-polynomial time approximation scheme for minimum weight triangulation. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, Minimum weight triangulation |
24 | Chun-Hao Chen, Tzung-Pei Hong, Vincent S. Tseng, Chang-Shing Lee |
A genetic-fuzzy mining approach for items with multiple minimum supports. |
Soft Comput. |
2009 |
DBLP DOI BibTeX RDF |
Genetic-fuzzy algorithm, Multiple minimum supports, Requirement satisfaction, Data mining, Clustering, k-means |
24 | Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai |
An Optimal Algorithm for the Minimum Disc Cover Problem. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Minimum disc cover, ?-hull, Applications in ad hoc networks, Optimal algorithms |
24 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
On the Minimum Hitting Set of Bundles Problem. |
AAIM |
2008 |
DBLP DOI BibTeX RDF |
minimum hitting set, min k??sat, approximation algorithm |
24 | Benigno Zurita Ares, Carlo Fischione, Karl Henrik Johansson |
Energy Consumption of Minimum Energy Coding in CDMA Wireless Sensor Networks. |
EWSN |
2007 |
DBLP DOI BibTeX RDF |
Minimum Energy Coding, OOK, Outages, Wireless Sensor Network (WSNs), Power Control, CDMA |
24 | Ping Ding, JoAnne Holliday |
A Dynamic Localized Minimum-Energy Agent Tree-Based Data Dissemination Scheme for Wireless Sensor Networks. |
ICA3PP |
2007 |
DBLP DOI BibTeX RDF |
Dynamic Localized, Sensor Networks, Data Dissemination, Minimum-Energy |
24 | Masaaki Homma, Seon Kim |
The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance. |
Des. Codes Cryptogr. |
2006 |
DBLP DOI BibTeX RDF |
Hermitian curve, two-point code, designed distance, minimum distance |
24 | Jia-Yu Chen, Chia-Yu Wan, Yi Chen, Berlin Chen, Lin-Shan Lee |
Minimum Phone Error (MPE) Model and Feature Training on Mandarin Broadcast News Task. |
ISCSLP |
2006 |
DBLP DOI BibTeX RDF |
minimum phone error (MPE), feature-space MPE (fMPE), offset fMPE, dimension-weighted, large-vocabulary continuous speech recognition (LVCSR), Discriminative training |
24 | Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle |
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
minimum corridor connection, generalized geometric problems, complexity, approximations, exact algorithms |
24 | Jan Remy, Angelika Steger |
A quasi-polynomial time approximation scheme for minimum weight triangulation. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, minimum weight triangulation |
24 | Xudong Wang 0001 |
An FDD Wideband CDMA MAC Protocol with Minimum-Power Allocation and GPS-Scheduling for Wireless Wide Area Multimedia Networks. |
IEEE Trans. Mob. Comput. |
2005 |
DBLP DOI BibTeX RDF |
CDMA GPS, minimum-power allocation, CAC, MAC protocol, Wideband CDMA, BER, FDD |
24 | Raja Jothi, Balaji Raghavachari |
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. |
ACM Trans. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, Spanning trees, minimum spanning trees |
24 | Xudong Wang 0001 |
Wide-band TD-CDMA MAC with minimum-power allocation and rate- and BER-scheduling for wireless multimedia networks. |
IEEE/ACM Trans. Netw. |
2004 |
DBLP DOI BibTeX RDF |
minimum-power allocation, wide-band TD-CDMA, quality of service (QoS), medium access control (MAC), bit-error rate (BER) |
24 | Franziska Berger, Peter Gritzmann, Sven de Vries |
Minimum Cycle Bases for Network Graphs. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Graph cycle, Minimum cycle basis, Matroid, Electrical network |
24 | Selda Küçükçifçi, Charles C. Lindner |
Minimum Covering for Hexagon Triple Systems. |
Des. Codes Cryptogr. |
2004 |
DBLP DOI BibTeX RDF |
hexagon triple system, minimum covering, perfect |
24 | Christian Plessl, Marco Platzner |
Instance-Specific Accelerators for Minimum Covering. |
J. Supercomput. |
2003 |
DBLP DOI BibTeX RDF |
instance-specific acceleration, minimum covering, reconfigurable computing |
24 | Hans L. Bodlaender, Udi Rotics |
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Minimum fill-in, Minimal separators, Graph algorithms, Treewidth, Polynomial algorithms, Modular decomposition |
24 | Anand Srinivas, Eytan H. Modiano |
Minimum energy disjoint path routing in wireless ad-hoc networks. |
MobiCom |
2003 |
DBLP DOI BibTeX RDF |
distributed algorithms, energy efficiency, wireless ad-hoc networks, multipath routing, disjoint paths, minimum energy |
24 | Seth Pettie, Vijaya Ramachandran |
An optimal minimum spanning tree algorithm. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
optimal complexity, Graph algorithms, minimum spanning tree |
24 | Ilya Dumer, Daniele Micciancio, Madhu Sudan 0001 |
Hardness of Approximating the Minimum Distance of a Linear Code. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
minimum distance problem, computational complexity, hardness of approximation, linear codes |
24 | Chia-Ju Wu |
Minimum-time control for an inverted pendulum under force constraints. |
J. Intell. Robotic Syst. |
1995 |
DBLP DOI BibTeX RDF |
minimum-time control, linear and nonlinear programming, numerical optimization, Inverted pendulum |
23 | Shu-Tao Xia, Fang-Wei Fu 0001 |
Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes. |
IEEE Trans. Inf. Theory |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 32431 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|