|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 101-120, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 63-77, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 283-292, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(2), pp. 262-276, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1997), September 22-25, 1997 Las Vegas, NV, USA, pp. 236-241, 1997, IEEE Computer Society, 0-8186-8186-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCSLP ![In: Chinese Spoken Language Processing, 5th International Symposium, ISCSLP 2006, Singapore, December 13-16, 2006, Proceedings, pp. 399-409, 2006, Springer, 3-540-49665-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 31(4), pp. 479-500, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(4), pp. 601-640, 1996. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 166(1), pp. 243-260, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August 12-15, 2007, pp. 310-319, 2007, ACM, 978-1-59593-609-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 726-733, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (4) ![In: Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part IV, pp. 1190-1202, 2005, Springer, 3-540-25863-9. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 202-213, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(4), pp. 534-559, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 50-59, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
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). ![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. 654-664, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (3) ![In: Knowledge-Based Intelligent Information and Engineering Systems, 10th International Conference, KES 2006, Bournemouth, UK, October 9-11, 2006, Proceedings, Part III, pp. 893-899, 2006, Springer, 3-540-46542-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Process. Lett. ![In: Neural Process. Lett. 26(2), pp. 121-131, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 53(11), pp. 1906-1918, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 39(3), pp. 189-208, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 440-451, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 193-204, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (2) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 262-265, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (5) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 165-173, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bangalore Compute Conf. ![In: Proceedings of the 3rd Bangalore Annual Compute Conference, Compute 2010, Bangalore, India, January 22-23, 2010, pp. 1:1-1:8, 2010, ACM, 978-1-4503-0001-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 168-191, 2009. The full citation details ...](Pics/full.jpeg) |
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]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 33-38, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 5:1-5:27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Graph algorithms, minimum spanning trees, random sampling |
29 | Xieping Gao, Chunhong Cao |
Minimum-energy wavelet frame on the interval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 51(10), pp. 1547-1562, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(1), pp. 53-72, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 131(1-4), pp. 283-304, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2009, Raleigh, NC, USA, February 14-18, 2009, pp. 15-24, 2009, ACM, 978-1-60558-397-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 432-439, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 298-301, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 8th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2005, December 7-9. 2005, Las Vegas, Nevada, USA, pp. 334-339, 2005, IEEE Computer Society, 0-7695-2509-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCSLP ![In: Chinese Spoken Language Processing, 5th International Symposium, ISCSLP 2006, Singapore, December 13-16, 2006, Proceedings, pp. 358-369, 2006, Springer, 3-540-49665-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
3DIM ![In: International Conference on Recent Advances in 3-D Digital Imaging and Modeling (3DIM '97), May 12-15, 1997, Ottawa, Ontario, Canada, pp. 101-106, 1997, IEEE Computer Society, 0-8186-7943-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 433-438, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(8), pp. 879-886, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(3), pp. 27:1-27:16, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 14(5), pp. 556-570, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(4), pp. 513-532, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 15(2), pp. 233-257, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 39(2), pp. 137-143, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008., pp. 88-99, 2008, Springer, 978-3-540-77890-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2008, Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet , 7th International IFIP-TC6 Networking Conference, Singapore, May 5-9, 2008, Proceedings, pp. 215-226, 2008, Springer, 978-3-540-79548-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, Santorini Island, Greece, June 11-14, 2008, Proceedings, pp. 266-281, 2008, Springer, 978-3-540-69169-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 779-786, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 49(4), pp. 367-383, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 46-55, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(3), pp. 361-375, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2005, Urbana-Champaign, IL, USA, May 25-27, 2005, pp. 390-401, 2005, ACM, 1-59593-004-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: 9th International Conference on Information Visualisation, IV 2005, 6-8 July 2005, London, UK, pp. 523-527, 2005, IEEE Computer Society, 0-7695-2397-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 388-397, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 49-60, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp. 163-173, 2000, Springer, 3-540-67159-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 2(4), pp. 339-349, 1991. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 347-357, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSN ![In: MSN 2009, The Fifth International Conference on Mobile Ad-hoc and Sensor Networks, Wu Yi Mountain, Fujian, China , December 14-16, 2009, pp. 212-217, 2009, IEEE Computer Society, 978-0-7695-3935-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO Workshops ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Workshop Proceedings, Washington DC, USA, June 25-26, 2005, pp. 199-211, 2005, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 302-309, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 659-668, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 80-89, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(6), pp. 865-869, 1989. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 24(10), pp. 1015-1018, 1975. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 26th International Conference on Computer Design, ICCD 2008, 12-15 October 2008, Lake Tahoe, CA, USA, Proceedings, pp. 294-300, 2008, IEEE Computer Society, 978-1-4244-2657-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Edward Omiecinski |
Alternative Interest Measures for Mining Associations in Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(1), pp. 57-69, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2010, 13th International Conference on Extending Database Technology, Lausanne, Switzerland, March 22-26, 2010, Proceedings, pp. 513-524, 2010, ACM, 978-1-60558-945-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 208-217, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 225-234, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 17(3), pp. 237-243, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(3), pp. 279-290, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(3), pp. 217-223, 1991. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 208-219, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 40(4), pp. 485-505, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Advances in Applied Artificial Intelligence, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006, Annecy, France, June 27-30, 2006, Proceedings, pp. 1329-1338, 2006, Springer, 3-540-35453-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | William J. Lenhart, Giuseppe Liotta |
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings, pp. 338-349, 2000, Springer, 3-540-41554-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Jan Remy, Angelika Steger |
A quasi-polynomial time approximation scheme for minimum weight triangulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(3), pp. 15:1-15:47, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 13(5), pp. 521-533, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(1), pp. 58-71, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings, pp. 3-14, 2008, Springer, 978-3-540-68865-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWSN ![In: Wireless Sensor Networks, 4th European Conference, EWSN 2007, Delft, The Netherlands, January 29-31, 2007, Proceedings, pp. 212-227, 2007, Springer, 3-540-69829-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 7th International Conference, ICA3PP 2007, Hangzhou, China, June 11-14, 2007, Proceedings, pp. 433-445, 2007, Springer, 978-3-540-72904-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 38(1), pp. 55-81, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCSLP ![In: Chinese Spoken Language Processing, 5th International Symposium, ISCSLP 2006, Singapore, December 13-16, 2006, Proceedings, pp. 270-281, 2006, Springer, 3-540-49665-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 69-82, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 316-325, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 4(1), pp. 16-28, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(2), pp. 265-282, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 12(1), pp. 103-116, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(1), pp. 51-62, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 32(1-3), pp. 251-265, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hexagon triple system, minimum covering, perfect |
24 | Christian Plessl, Marco Platzner |
Instance-Specific Accelerators for Minimum Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 26(2), pp. 109-129, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 36(4), pp. 375-408, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking, MOBICOM 2003, 2003, San Diego, CA, USA, September 14-19, 2003, pp. 122-133, 2003, ACM, 1-58113-753-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(1), pp. 16-34, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![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. 475-485, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 12(2), pp. 127-143, 1995. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(1), pp. 480-485, 2008. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|