|
|
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 |
18 | Henri Nicolas, Stéphane Pateux, Delphine Le Guen |
Minimum Description Length Criterion for Region-Based Video Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (1) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 346-349, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
minimum description length criterion, region-based video compression, MDL criterion, region-based motion compensation, partially coded, segmentation coding cost, data compression, video sequences, polygonal approximation, motion parameters, region-based segmentation, polygonal representation, displaced frame difference |
18 | Ten-Ho Lin, Von-Wun Soo |
Pruning Fuzzy ARTMAP using the Minimum Description Length Principle in Learning from Clinical Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 9th International Conference on Tools with Artificial Intelligence, ICTAI '97, Newport Beach, CA, USA, November 3-8, 1997, pp. 396-, 1997, IEEE Computer Society, 0-8186-8203-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
learning from database), minimum description length, fuzzy ARTMAP |
18 | Michalis Faloutsos, Mart L. Molle |
What features really make distributed minimum spanning tree algorithms efficient?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), June 3-6, 1996, Tokyo, Japan, Proceedings, pp. 106-, 1996, IEEE Computer Society, 0-8186-7267-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
distributed minimum spanning tree, Distributed Information, computational complexity, distributed algorithms, graph theory, multiprocessor interconnection networks, communication complexity, running times, performance improvement, complexity measures, message complexity |
18 | Mingui Sun, Robert J. Sclabassi |
Symmetric wavelet edge detector of the minimum length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 177-180, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
symmetric wavelet edge detector, infinite support, minimum length, wavelet transforms, wavelet transform, edge detection, images, minimisation, digital filters, digital filters, computational cost, roundoff errors, truncation error, edge localization |
18 | Shashidhar Thakur, D. F. Wong 0001 |
Simultaneous area and delay minimum K-LUT mapping for K-exact networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 402-408, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
area/delay minimum K-LUT mapping, K-exact networks, technology mapping problem, lookup table FPGAs, area minimization problem, K-bounded networks, delay minimization problem, flow-map algorithm, field programmable gate arrays, computational complexity, complexity, NP-complete, logic design, polynomial time algorithm, programmable logic arrays, table lookup, minimisation of switching nets |
18 | William S. Hiles, David T. Marlow |
Approximation of FDDI minimum reconfiguration time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 20th Conference on Local Computer Networks (LCN'95), Minneapolis, Minnesota, USA, October 16-19, 1995, pp. 360-369, 1995, IEEE Computer Society, 0-8186-7162-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
military communication, FDDI minimum reconfiguration time approximation, military platforms, reconfiguration timing, FDDI product testing, timing, data transfer, FDDI, military computing, LAN interconnection, mission critical systems, interconnection topologies |
18 | Erik McDermott, Shigeru Katagiri |
Prototype-based minimum error training for speech recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 4(3), pp. 245-256, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Minimum error training, speech recognition, pattern classification |
18 | Klaus Simon |
On Minimum Flow and Transitive Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 535-546, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Minimum flow, transitive reduction, random digraph, transitive closure |
18 | Chen Tian 0001, Hongbo Jiang 0001, Xue Liu, Wenyu Liu 0001, Yi Wang 0049 |
Towards Minimum Traffic Cost and Minimum Response Latency: A Novel Dynamic Query Protocol in Unstructured P2P Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2008 International Conference on Parallel Processing, ICPP 2008, September 8-12, 2008, Portland, Oregon, USA, pp. 1-8, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Zhao Li, Wei Zhang, Hengchang Liu, Baohua Zhao, Yugui Qu |
Multicast Routing with Minimum Energy Cost and Minimum Delay in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUC Workshops ![In: Embedded and Ubiquitous Computing - EUC 2005 Workshops, EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES, Nagasaki, Japan, December 6-9, 2005, Proceedings, pp. 1157-1168, 2005, Springer, 3-540-30803-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
MEMD multicast, MLST, Wireless Sensor Networks, STDMA |
18 | Miroslav Chlebík, Janka Chlebíková |
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 415-424, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Raffaele Mosca |
A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(3), pp. 517-528, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki |
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 373-382, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Boris Kryzhanovsky, Bashir M. Magomedov, Anatoly B. Fonarev |
On the Probability of Finding Local Minima in Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2006, part of the IEEE World Congress on Computational Intelligence, WCCI 2006, Vancouver, BC, Canada, 16-21 July 2006, pp. 3243-3248, 2006, IEEE, 0-7803-9490-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Jinxiang Chai, Shing-Chow Chan, Heung-Yeung Shum, Xin Tong 0001 |
Plenoptic sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2000, New Orleans, LA, USA, July 23-28, 2000, pp. 307-318, 2000, ACM, 1-58113-208-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
plenoptic sampling, sampling, image-based rendering, spectral analysis, plenoptic functions |
18 | Maria C. Yuang, Yu G. Chen, M. T. Yen |
Optimal multicast routing for ATM networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 20th Conference on Local Computer Networks (LCN'95), Minneapolis, Minnesota, USA, October 16-19, 1995, pp. 413-421, 1995, IEEE Computer Society, 0-8186-7162-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
optimal multicast routing algorithm, LOPT, load-sensitive networks, delay-sensitive, performance evaluation, computational complexity, computational complexity, asynchronous transfer mode, ATM networks, multicast routing, telecommunication network routing, multicast communication, delay bound |
17 | Johan M. M. van Rooij, Hans L. Bodlaender |
Exact Algorithms for Edge Domination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 214-225, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimum maximal matching, exponential time algorithms, measure and conquer, exact algorithms, edge dominating set |
17 | Alessandro Bissacco, Alessandro Chiuso, Stefano Soatto |
Classification and Recognition of Dynamical Models: The Role of Phase, Independent Components, Kernels and Optimal Transport. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(11), pp. 1958-1972, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Non-minimum Phase, Hammerstein models, Optimal Transport, Wasserstein models, Non-Gaussian models, Learning, Time Series, Kernel, Distance, System Identification, Higher-Order Statistics, Blind Deconvolution |
17 | Eva K. Lee, Todd Easton, Kapil Gupta |
Novel evolutionary models and applications to sequence alignment problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 148(1), pp. 167-187, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Evolutionary distance problem, Minimum weight common mutated sequence, Node-packing polytope, Multiple sequence alignment, DNA sequencing, Sequence comparison, Conflict graph, Supernode, Phylogenetic analysis |
17 | Kun-Ming Yu, Jiayi Zhou, Chun-Yuan Lin, Chuan Yi Tang |
An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA Workshops ![In: Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops, ISPA 2006 International Workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006, Proceedings, pp. 215-220, 2006, Springer, 3-540-49860-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
minimum ultrametric tree, parallel branch-and-bound algorithm, 3-point relationship, 4-point relationship, phylogenetic tree |
17 | Oguz Altun, Songül Albayrak, Ali Ekinci, Behzat Bükün |
Turkish Fingerspelling Recognition System Using Axis of Least Inertia Based Fast Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2006: Advances in Artificial Intelligence, 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006, Proceedings, pp. 473-481, 2006, Springer, 3-540-49787-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Turkish Fingerspelling Recognition, Fast Alignment, Angle of orientation, Axis of Least Inertia, Minimum Bounding Square, Classification |
17 | Terence K. T. Law, John C. S. Lui, David K. Y. Yau |
You Can Run, But You Can't Hide: An Effective Statistical Methodology to Trace Back DDoS Attackers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(9), pp. 799-813, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
attack traffic filtering, minimum stable time, DDoS attack, traceback |
17 | Budhaditya Deb, Badri Nath |
On the node-scheduling approach to topology control in ad hoc 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. 14-26, 2005, ACM, 1-59593-004-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minimum virtual dominating sets, reliable packet delivery, ad-hoc networks, topology control, node scheduling |
17 | Yiwei Thomas Hou, Shivendra S. Panwar, Henry H.-Y. Tzeng |
On Generalized Max-Min Rate Allocation and Distributed Convergence Algorithm for Packet Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 15(5), pp. 401-416, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Max-min rate allocation, minimum rate, peak rate, centralized algorithm, distributed algorithm, convergence, flow control, packet networks |
17 | Chandra Chekuri, Sudipto Guha, Joseph Naor |
Approximating Steiner k-Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 189-199, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Multiway Cut, $k$-Cut, Steiner tree, minimum cut, primal-dual |
17 | Timothy M. Chan |
Euclidean bounded-degree spanning tree ratios. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 11-19, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximation, minimum spanning trees, discrete geometry |
17 | Carlo Gaibisso, Guido Proietti, Richard B. Tan |
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 404-414, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Transient Node Failures, Radio Networks Survivability, Planar Graphs, Minimum Spanning Tree |
17 | Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni |
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings, pp. 312-327, 2001, Springer, 3-540-42672-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Directed hypergraph, minimum weight hyperpath, dynamic algorithm, AND/OR graph |
17 | Zhanping Chen, Kaushik Roy 0001, Tan-Li Chou |
Power sensitivity - a new method to estimate power dissipation considering uncertain specifications of primary inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 40-44, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Monte Carlo based approach, maximum bounds, minimum bounds, power dissipation estimation, power sensitivity, primary inputs, signal properties, signal switching, uncertain specifications, logic CAD, CMOS logic circuits, power estimation, CMOS circuits, signal probability, statistical technique |
17 | Rachid Sammouda, Noboru Niki, Hiromu Nishitani |
Multichannel segmentation of magnetic resonance cerebral images based on neural networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 484-487, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
multichannel segmentation, magnetic resonance cerebral images, cost-term, energy function minimization, temporary noise, metastaric tumor, neural networks, image segmentation, convergence, medical image processing, minimisation, brain, brain, Hopfield neural network, convergence of numerical methods, biomedical NMR, Hopfield neural nets, global minimum |
17 | Mayez A. Al-Mouhamed |
Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(12), pp. 1390-1401, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
precedence graphs, earliest starting time, task delay, finish time, minimum time increase, interprocessor communication links, optimum performance, small graphs, scheduling, scheduling, graph theory, lower bounds, communication costs, task graph, completion time, time interval |
16 | Timo Kötzing, Per Kristian Lehre, Frank Neumann 0001, Pietro S. Oliveto |
Ant colony optimization and the minimum cut problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 1393-1400, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
ant colony optimization, min-cut |
16 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(1), pp. 49-60, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Entropy, Greedy algorithm, Hardness of approximation, Set cover |
16 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum entropy coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(4), pp. 361-377, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Complexity, Entropy, Graph coloring |
16 | Mingyu Xiao 0001 |
Finding Minimum 3-Way Cuts in Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 270-281, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Giuseppe Valenzise, Marco Tagliasacchi, Stefano Tubaro |
Minimum variance multiplexing of multimedia objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2008, March 30 - April 4, 2008, Caesars Palace, Las Vegas, Nevada, USA, pp. 1133-1136, 2008, IEEE, 1-4244-1484-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Mei Wang, Guohong Wang |
An Optimization Algorithm of Vehicle License Plate Correction Based on Minimum Projection Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICYCS ![In: Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008, pp. 1701-1705, 2008, IEEE Computer Society, 978-0-7695-3398-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Boris Kryzhanovsky, Vladimir Kryzhanovsky |
Binary Optimization: On the Probability of a Local Minimum Detection in Random Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAISC ![In: Artificial Intelligence and Soft Computing - ICAISC 2008, 9th International Conference, Zakopane, Poland, June 22-26, 2008, Proceedings, pp. 89-100, 2008, Springer, 978-3-540-69572-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman 0001 |
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 408-419, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Arvind Gupta, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey |
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 374-383, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Mikkel Thorup |
Minimum k-way cuts via deterministic greedy tree packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 159-166, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
k-way cuts, tree packing |
16 | Sebastian Böcker, Quang Bao Anh Bui, Anke Truß |
An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 43-54, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Alex Rogers, Esther David, Nicholas R. Jennings, Jeremy Schiff |
The effects of proxy bidding and minimum bid increments within eBay auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Web ![In: ACM Trans. Web 1(2), pp. 9, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
bid increment, proxy bidding, sniping, electronic commerce, Online auctions |
16 | Sanjiv Kapoor, Mohammad Sarwat |
Bounded-Diameter Minimum-Cost Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(4), pp. 779-794, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Chien Yao, Po-Ning Chen, Tsang-Yi Wang, Yunghsiang S. Han, Pramod K. Varshney |
Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(5), pp. 1716-1734, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Federico Mancini 0001 |
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 881-892, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | 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) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 43-52, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
16 | Minh N. Doan |
An effective ant-based algorithm for the degree-constrained minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 485-491, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001 |
New Approximation Algorithms for Minimum Cycle Bases of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 512-523, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski |
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 260-271, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Yang Yang 0012, Mingen Lin, Jinhui Xu 0001, Yulai Xie |
Minimum Spanning Tree with Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings, pp. 306-316, 2007, Springer, 978-3-540-72868-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Kaviraj Chopra, Sarma B. K. Vrudhula |
Efficient Symbolic Algorithms for Computing the Minimum and Bounded Leakage States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(12), pp. 2820-2832, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Toshihiro Fujito |
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 431-442, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 250-261, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Hee-Sang Ko, Kwang Y. Lee, Min-Jae Kang, Ho-Chan Kim |
Generalized Minimum Variance Neuro Controller for Power System Stabilization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (2) ![In: Advances in Neural Networks - ISNN 2006, Third International Symposium on Neural Networks, Chengdu, China, May 28 - June 1, 2006, Proceedings, Part II, pp. 1338-1347, 2006, Springer, 3-540-34437-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Jungsik Lee, Ravi Sankar |
Theoretical Derivation of Minimum Mean Square Error of RBF Based Equalizer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC (1) ![In: Advances in Natural Computation, Second International Conference, ICNC 2006, Xi'an, China, September 24-28, 2006. Proceedings, Part I, pp. 293-302, 2006, Springer, 3-540-45901-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Takeya Shigezumi |
Robustness of Greedy Type Minimum Evolution Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part II, pp. 815-821, 2006, Springer, 3-540-34381-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani |
Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part II, pp. 758-766, 2006, Springer, 3-540-34381-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Oleksandr Grygorash, Yan Zhou, Zach Jorgensen |
Minimum Spanning Tree Based Clustering Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 13-15 November 2006, Arlington, VA, USA, pp. 73-81, 2006, IEEE Computer Society, 0-7695-2728-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri |
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 227-239, 2006, Springer, 3-540-35474-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser |
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 3-14, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 61-69, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Ashish Kumar Singh, Murari Mani, Ruchir Puri, Michael Orshansky |
Gain-based technology mapping for minimum runtime leakage under input vector uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 43rd Design Automation Conference, DAC 2006, San Francisco, CA, USA, July 24-28, 2006, pp. 522-527, 2006, ACM, 1-59593-381-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
leakage, technology mapping, logical effort |
16 | Mamatha Rudrapatna, Arcot Sowmya |
Feature Weighted Minimum Distance Classifier with Multi-class Confidence Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2006: Advances in Artificial Intelligence, 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006, Proceedings, pp. 253-263, 2006, Springer, 3-540-49787-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Jie Wu 0001, Zhen Jiang |
On constructing the minimum orthogonal convex polygon for the fault-tolerant routing in 2-D faulty meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 54(3), pp. 449-458, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Longjiang Guo, Weili Wu 0001, Feng Wang 0002, My T. Thai |
An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(4), pp. 391-394, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
splitting/nonsplitting node, multicast, optical network |
16 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Coloring. ![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. 819-828, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao |
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ![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. 472-483, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Noseong Park, Daeyoung Kim 0001, Yoonmee Doh, Sangsoo Lee, Ji-tae Kim |
An Optimal and Lightweight Routing for Minimum Energy Consumption in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), 17-19 August 2005, Hong Kong, China, pp. 387-393, 2005, IEEE Computer Society, 0-7695-2346-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir, Ravi Sundaram |
Minimum energy accumulative routing in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA, pp. 1875-1886, 2005, IEEE, 0-7803-8968-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Rasmus Andersen, Brian Vinter |
Transparent Remote File Access in the Minimum Intrusion Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WETICE ![In: 14th IEEE International Workshops on Enabling Technologies (WETICE 2005), 13-15 June 2005, Linköping, Sweden, pp. 311-318, 2005, IEEE Computer Society, 0-7695-2362-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Victor Chepoi, Karim Nouioua, Yann Vaxès |
A Rounding Algorithm for Approximating Minimum Manhattan Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 40-51, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Aditya Dua, Uday B. Desai, Ranjan K. Mallik |
Minimum probability of error-based methods for adaptive multiuser detection in multipath DS-CDMA channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 3(3), pp. 939-948, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
The Computational Complexity of the Minimum Weight Processor Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 189-200, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Jie Wu 0001, Zhen Jiang |
On Constructing the Minimum Orthogonal Convex Polygon in 2-D Faulty Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Xiaoming Chen, Zheng Tang, Xinshun Xu, Songsong Li, Guangpu Xia, Jiahai Wang |
An Algorithm Based on Hopfield Network Learning for Minimum Vertex Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2004, International Symposium on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings, Part I, pp. 430-435, 2004, Springer, 3-540-22841-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Yeong-Chyi Lee, Tzung-Pei Hong, Wen-Yang Lin |
Mining Fuzzy Association Rules with Multiple Minimum Supports Using Maximum Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 8th International Conference, KES 2004, Wellington, New Zealand, September 20-25, 2004. Proceedings. Part II, pp. 1283-1290, 2004, Springer, 3-540-23206-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Kaviraj Chopra, Sarma B. K. Vrudhula, Sarvesh Bhardwaj |
Efficient Algorithms for Identifying the Minimum Leakage States in CMOS Combinational Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 17th International Conference on VLSI Design (VLSI Design 2004), with the 3rd International Conference on Embedded Systems Design, 5-9 January 2004, Mumbai, India, pp. 240-, 2004, IEEE Computer Society, 0-7695-2072-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Andrew Lim 0001, Fan Wang 0003, Zhou Xu 0001 |
On the Selection and Assignment with Minimum Quantity Commitments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 102-111, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany |
The Minimum Shift Design Problem: Theory and Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 593-604, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Sudipta Sengupta |
Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 79-90, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Seth Pettie, Vijaya Ramachandran |
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 713-722, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
16 | Binay K. Bhattacharya, Asish Mukhopadhyay |
On the Minimum Perimeter Triangle Enclosing a Convex Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pp. 84-96, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison |
Change-Point Estimation Using New Minimum Message Length Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2002: Trends in Artificial Intelligence, 7th Pacific Rim International Conference on Artificial Intelligence, Tokyo, Japan, August 18-22, 2002, Proceedings, pp. 244-254, 2002, Springer, 3-540-44038-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Refael Hassin, Asaf Levin |
Minimum Restricted Diameter Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 175-184, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Yaw-Ling Lin, Fang-Rong Hsu, Yin-Te Tsai |
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 126-136, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Shien-Ching Hwang, Gen-Huey Chen |
The Minimum Spanner Problem on Butterfly Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 5th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2000), 7-10 December 2000, Dallas / Richardson, TX, USA, pp. 210-215, 2000, IEEE Computer Society, 0-7695-0936-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Sung Deuk Kim, Jong Beom Ra |
An efficient motion vector coding scheme based on minimum bitrate prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 8(8), pp. 1117-1120, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Cao An Wang, Bo-Ting Yang |
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 265-275, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Guo-Hui Lin, Guoliang Xue, Defang Zhou |
Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: Proceedings of the IEEE International Conference On Computer Design, VLSI in Computers and Processors, ICCD '99, Austin, Texas, USA, October 10-13, 1999, pp. 392-, 1999, IEEE Computer Society, 0-7695-0406-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
VLSI physical design, hexagonal routing, approximation algorithms |
16 | Vishwani D. Agrawal, Michael L. Bushnell, Ganapathy Parthasarathy, Rajesh Ramadoss |
Digital Circuit Design for Minimum Transient Energy and a Linear Programming Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 12th International Conference on VLSI Design (VLSI Design 1999), 10-13 January 1999, Goa, India, pp. 434-439, 1999, IEEE Computer Society, 0-7695-0013-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Alexander V. Karzanov |
A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(4), pp. 549-568, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C27, 90B10 |
16 | Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein 0001 |
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 338-352, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 176-184, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Wai-Kei Mak, Martin D. F. Wong |
Minimum replication min-cut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(10), pp. 1221-1227, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Amotz Bar-Noy, Guy Kortsarz |
The Minimum Color Sum of Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 738-748, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Chor Ping Low, Hon Wai Leong |
Minimum fault coverage in memory arrays: a fast algorithm and probabilistic analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(6), pp. 681-690, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena, Tae-Heng Yang |
On Minimum-Area Hulls (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 334-348, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Wai-Kei Mak, D. F. Wong 0001 |
Minimum replication min-cut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996, pp. 205-210, 1996, IEEE Computer Society / ACM, 0-8186-7597-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
min-cut partitioning, circuit partitioning, logic replication |
16 | Jianxiu Hao, James B. Orlin |
A Faster Algorithm for Finding the Minimum Cut in a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 165-174, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
Displaying result #301 - #400 of 32431 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|