|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15579 occurrences of 6274 keywords
|
|
|
Results
Found 35463 publication records. Showing 35463 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
67 | Kazumaro Aoki |
On Maximum Non-averaged Differential Probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings, pp. 118-130, 1998, Springer, 3-540-65894-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
maximum average of differential probability, linear hull, maximum average of linear probability, maximum non-averaged differential probability, maximum non-averaged linear probability, DES-like cipher, Differential cryptanalysis, differential, linear cryptanalysis |
66 | Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh |
Efficient Algorithms for Variants of Weighted Matching and Assignment Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 673-688, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Maximum weight maximum cardinality matching, approximation algorithm, graph algorithm, reduction |
46 | Tien-Ching Lin, D. T. Lee |
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 460-473, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
k maximum sums problem, sum selection problem, maximum sum problem, maximum sum subarray problem |
43 | Sung Eun Bae, Tadao Takaoka |
Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 247-253, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
maximum subarray, maximum subsequence, VLSI, prefix sums |
40 | Tien-Ching Lin, D. T. Lee |
Randomized Algorithm for the Sum Selection Problem. ![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. 515-523, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
order-statistic tree, k maximum sums problem, sum selection problem, maximum sum problem, maximum sum subarray problem, computational geometry, randomized algorithm, random sampling |
39 | Yu-Sheng Huang, Chih-wen Hsueh |
Minimizing the maximum end-to-end delay on tree structure using the distributed pinwheel model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 12-14 December 2000, Cheju Island, South Korea, pp. 127-134, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
maximum end-to-end delay minimisation, distributed pinwheel model, end-to-end timing requirements, tight maximum delay bound, quality of service, Internet, computational complexity, timing, computer networks, heuristic algorithm, processor scheduling, timing constraints, simulation result, distributed real-time systems, tree structure, heuristic programming, NP-hard problems, linear-time algorithm, pipeline structure |
37 | Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee |
Parallel algorithms for maximum matching in interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 84-92, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model |
36 | Serge Ayer, Harpreet S. Sawhney |
Layered Representation of Motion Video Using Robust Maximum-Likelihood Estimation of Mixture Models and MDL Encoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: Procedings of the Fifth International Conference on Computer Vision (ICCV 95), Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, June 20-23, 1995, pp. 777-, 1995, IEEE Computer Society, 0-8186-7042-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
motion video, robust maximum-likelihood estimation, spatial support, motion video sequences, dynamic image understanding, motion estimation, image sequences, encoding, encoding, mixture models, maximum likelihood estimation, maximum likelihood estimation, minimum description length, layered representation |
32 | Zoltan Kato, Josiane Zerubia, Marc Berthod |
Unsupervised Parallel Image Classificiation Using a Hierarchical Markovian Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: Procedings of the Fifth International Conference on Computer Vision (ICCV 95), Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, June 20-23, 1995, pp. 169-174, 1995, IEEE Computer Society, 0-8186-7042-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
unsupervised parallel image classification, hierarchical Markovian model, segmentation problem, hidden label field parameters, observable image, iterative conditional estimation, estimation-maximization algorithm, tentative labeling, Connection Machine CM200, comparative tests, noisy synthetic images, noisy real images, computer vision, image segmentation, parallel processing, Markov random fields, Markov processes, iterative methods, image classification, remote sensing, remote sensing, maximum likelihood estimation, maximum likelihood estimate, random processes, hierarchical systems, maximum a posteriori estimate, model parameters |
32 | Karthikeyan Lingasubramanian, Sanjukta Bhanja |
Probabilistic maximum error modeling for unreliable logic circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, Stresa, Lago Maggiore, Italy, March 11-13, 2007, pp. 223-226, 2007, ACM, 978-1-59593-605-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
maximum error, MAP |
32 | Xue-Bin Liang |
Matrix games in the multicast networks: maximum information flows with network switching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2433-2466, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems |
32 | Benny Chor, Tamir Tuller |
Finding a maximum likelihood tree is hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 722-744, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximate vertex cover, tree reconstruction, Maximum likelihood, maximum parsimony, intractability |
32 | Stavros D. Nikolopoulos, Leonidas Palios |
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Panhellenic Conference on Informatics ![In: Advances in Informatics, 10th Panhellenic Conference on Informatics, PCI 2005, Volos, Greece, November 11-13, 2005, Proceedings, pp. 68-79, 2005, Springer, 3-540-29673-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
P4-sparse graphs, maximum-size subgraphs, perfect matching, maximum matchings, Perfect graphs, cographs |
32 | Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth |
Budgeted Maximum Graph Coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 321-332, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
budgeted maximum coverage, approximation algorithm, integer linear programming, treewidth, maximum weight matching |
32 | Jesse Bennett, Alireza Khotanzad |
A Maximum Likelihood Estimation Method for Multispectral Autoregressive Image Models. ![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. 839-842, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
multispectral autoregressive image models, random field image models, multispectral simultaneous autoregressive model, natural texture samples, image segmentation, experiments, parameter estimation, maximum likelihood estimation, maximum likelihood estimation, color images, Gaussian distribution |
31 | Marcelo Arenas, Jorge Pérez 0001, Cristian Riveros |
The recovery of a schema mapping: bringing exchanged data back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada, pp. 13-22, 2008, ACM, 978-1-60558-108-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
maximum recovery, data integration, recovery, data exchange, schema mapping, inverse, metadata management |
30 | Zhenhong Liu, Jianzhong Zhang 0001 |
On Inverse Problems of Optimum Perfect Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(3), pp. 215-228, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximum-mean alternating cycle, ellipsoid method, linear programming, perfect matching, strongly polynomial algorithm, maximum-weight matching |
30 | Maria Grazia Scutellà |
A note on the parametric maximum flow problem and some related reoptimization issues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 231-244, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Parametric arc capacity, Maximum flow |
30 | Ryuhei Uehara, Zhi-Zhong Chen |
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 84-98, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
parallel algorithm, approximation algorithm, Graph algorithm, maximum weighted matching |
29 | Vincent Berry, Zeshan Peng, H. F. Ting |
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(3), pp. 369-385, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Maximum agreement subtrees, Constrained maximum agreement subtrees, Bioinformatics, Consensus, Reduction, Evolutionary trees |
29 | Shin-Cheng Mu |
Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, San Francisco, California, USA, January 7-8, 2008, pp. 31-39, 2008, ACM, 978-1-59593-977-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
maximum segment density, maximum segment sum, program derivation |
29 | G. D. Rayner, Helen L. MacGillivray |
Numerical maximum likelihood estimation for the g-and-k and generalized g-and-h distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stat. Comput. ![In: Stat. Comput. 12(1), pp. 57-75, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
maximum likelihood estimation (MLE), quantile distributions, g-and-k distribution, generalized g-and-h distribution, numerical maximum likelihood estimation (NMLE) |
29 | Dao-I Lin, Zvi M. Kedem |
Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 14(3), pp. 553-566, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
maximum frequent set, Pincer Search, maximum frequent candidate set, Data mining, association rule, knowledge discovery |
27 | Javed A. Aslam, Emine Yilmaz, Virgiliu Pavlu |
The maximum entropy method for analyzing retrieval measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Salvador, Brazil, August 15-19, 2005, pp. 27-34, 2005, ACM, 1-59593-034-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
precision-recall curve, modeling, evaluation, maximum entropy, average precision |
27 | Torsten Fahle |
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 485-498, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
branch-and-bound, constraint programming, maximum clique, cost based filtering |
27 | Hsiao-Fei Liu, Kun-Mao Chao |
On Locating Disjoint Segments with Maximum Sum of Densities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(1), pp. 107-117, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Maximum-average segment, Maximum-density segment, Sequence analysis |
27 | Nicholas Nash, Sylvain Lelait, David Gregg |
Efficiently implementing maximum independent set algorithms on circle graphs. ![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 |
Circle graph, maximum stable set, maximum independent set |
27 | Mauricio G. C. Resende, Thomas A. Feo, Stuart H. Smith |
Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 24(4), pp. 386-394, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
combinatorial optimization, FORTRAN, local search, GRASP, maximum independent set, maximum clique, Fortran subroutines |
27 | Timothy J. Schulz |
A Fast Algorithm for Maximum-Likelihood Imaging with Coherent Speckle Measurements. ![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. 679-682, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
maximum-likelihood imaging, coherent speckle measurements, space alternating expectation-maximization, SAGE method, coherent-speckle imaging, 2D spectrum estimation, algorithm convergence, expectation-maximization based algorithm, penalized maximum-likelihood estimation, Gaussian random process, speckle, sensors array |
27 | Antonio Colmenarez, Thomas S. Huang |
Maximum Likelihood Face Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FG ![In: 2nd International Conference on Automatic Face and Gesture Recognition (FG '96), October 14-16, 1996, Killington, Vermont, USA, pp. 307-311, 1996, IEEE Computer Society, 0-8186-7713-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Face Detection, Maximum likelihood, Maximum Entropy |
27 | Vladimir Z. Mesarovic, Nikolas P. Galatsanos, Miles N. Wernick |
Iterative maximum a posteriori (MAP) restoration from partially-known blur for tomographic reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 512-515, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
iterative maximum a posteriori restoration, MAP algorithm, signal-covariance estimation, signal-covariance restoration, system response matrix, noisy blurred sinogram, covariance estimator, iterative linear minimum mean-squared-error filter, LMMSE filter, tomographic reconstruction, iterative MAP restoration, image reconstruction, medical imaging, iterative methods, image restoration, maximum likelihood estimation, medical image processing, matrix algebra, tomography, computerised tomography, convergence analysis, covariance analysis |
27 | S. S. Ganugapati, C. R. Moloney |
A ratio edge detector for speckled images based on maximum strength edge pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 165-168, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
airborne radar, ratio edge detector, edge detection method, speckled images, maximum strength edge pruning, localized edge maps, maximum strength edge pruning ratio of averages, edge orientation information, MSP-RoA method, airborne synthetic aperture radar images, edge detection, synthetic aperture radar, SAR images, radar imaging, speckle |
27 | Zhenyu Zhou, Richard M. Leahy |
Approximate maximum likelihood hyperparameter estimation for Gibbs priors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 284-287, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
approximate maximum likelihood hyperparameter estimation, Gibbs priors, MAP image estimate, mean field approximation technique, multidimensional Gibbs distributions, one dimensional densities, Gibbs-Bogoliubov-Feynman bound, optimization, image reconstruction, image reconstruction, image restoration, maximum likelihood estimation |
26 | Jahangir H. Sarker, Hussein T. Mouftah |
Optimum multichannel random access with retransmission cut-off in OFDMA wireless systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSWiM ![In: Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2008, Vancouver, British Columbia, Canada, October 27-31, 2008, pp. 341-345, 2008, ACM, 978-1-60558-235-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
maximum number of allowed retrials, new packet arrival rate, stable operation, OFDMA, slotted ALOHA, maximum throughput |
26 | Hiroaki Takada, Ken Sakamura |
Real-time scalability of nested spin locks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 2nd International Workshop on Real-Time Computing Systems and Applications, October 25 - 27, 1995, Tokyo, Japan, pp. 160-167, 1995, IEEE Computer Society, 0-8186-7106-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
real-time scalability, nested spin locks, interprocessor synchronizations, maximum execution times, maximum nesting level, performance evaluation, real-time systems, real-time system, performance measurements, synchronisation, shared-memory multiprocessor, shared memory systems, worst-case performance |
25 | Sarah Spence Adams, Nathaniel J. Karst, Jonathan Pollack |
The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space-Time Block Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(8), pp. 2677-2684, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Fei Li 0003, Lei He 0001 |
Maximum current estimation considering power gating. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2001 International Symposium on Physical Design, ISPD 2001, Sonoma County, CA, USA, April 1-4, 2001, pp. 106-111, 2001, ACM, 1-58113-347-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
low-power design, ATPG, power estimation, power gating |
25 | Chuan-Yu Wang, Kaushik Roy 0001 |
COSMOS: a continuous optimization approach for maximum power estimation of CMOS circuits. ![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. 52-55, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
CMOS Digital Circuits, Reliability, Power Estimation |
25 | Li-Hua Feng, Gao-Yuan Luo |
The relationship between seismic frequency and magnitude as based on the Maximum Entropy Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 13(10), pp. 979-983, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Disorder, Relationship between seismic frequency and magnitude, Distribution, Maximum Entropy Method |
25 | Wayne J. Pullan |
Approximating the maximum vertex/edge weighted clique using local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(2), pp. 117-134, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Local search, Maximum weighted clique |
25 | Min Xie, Lixin Gao, Haiwa Guan |
Ant Algorithm Applied in the Minimal Cost Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 201-208, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal cost maximum flow problem, ant algorithm, directed network |
25 | Errol L. Lloyd, Rui Liu 0001, S. S. Ravi |
Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(2), pp. 129-142, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
maximum power users, approximation algorithm, topology control, adhoc network |
25 | Oliver Giel, Ingo Wegener |
Maximum cardinality matchings on trees by randomized local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 539-546, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
maximum cardinality matchings, randomized local search, evolutionary algorithms, runtime analysis |
25 | Timo Poranen |
Heuristics for the Maximum Outerplanar Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 11(1), pp. 59-88, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
triangular cactus heuristic, maximum outerplanar subgraph problem, simulated annealing |
25 | Francis Y. L. Chin, Jianbo Qian, Cao An Wang |
Progress on Maximum Weight Triangulation. ![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. 53-61, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Maximum weight triangulation, Algorithm, Approximation |
25 | Lorina Dascal, Nir A. Sochen |
The Maximum Principle for Beltrami Color Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Scale-Space ![In: Scale Space Methods in Computer Vision, 4th International Conference, Scale-Space 2003, Isle of Skye, UK, June 10-12, 2003, Proceedings, pp. 196-208, 2003, Springer, 3-540-40368-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Beltrami Framework, Parabolic PDE's, Finite difference schemes, Maximum Principle |
25 | Sudhakar Bobba, Ibrahim N. Hajj |
Maximum Current Estimation in Programmable Logic Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 8th Great Lakes Symposium on VLSI (GLS-VLSI '98), 19-21 February 1998, Lafayette, LA, USA, pp. 301-306, 1998, IEEE Computer Society, 0-8186-8409-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
maximum current, PLA |
25 | Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju |
A Self-Stabilizing Algorithm for the Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 10(4), pp. 167-180, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Fault-tolerance, Distributed algorithms, Self-stabilization, Maximum flow |
25 | Chuan-Yu Wang, Kaushik Roy 0001 |
Maximum power estimation for CMOS circuits using deterministic and statistic approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 9th International Conference on VLSI Design (VLSI Design 1996), 3-6 January 1996, Bangalore, India, pp. 364-369, 1996, IEEE Computer Society, 0-8186-7228-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
maximum power estimation, deterministic approach, instantaneous power consumption, ATG technique, Monte Carlo based technique, computational complexity, VLSI, lower bound, statistical analysis, automatic testing, circuit analysis computing, Monte Carlo methods, automatic test generation, VLSI circuits, CMOS circuits, CMOS digital integrated circuits, statistic approach |
25 | Kequin Li |
Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 33th Annual Southeast Regional Conference, 1995, Clemson, South Carolina, USA, March 17-18, 1995, pp. 219-226, 1995, ACM, 978-0-89791-747-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
maximum subset sum, multiprogrammed parallel system, sequential selection, approximation algorithm, probabilistic analysis, knapsack, recurrence relations |
25 | Shu-Cherng Fang, Jacob H.-S. Tsao |
Maximum Entropy Principle: Image Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2004-2009, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Entropy optimization, Principle of maximum entropy, Image reconstruction, Maximum entropy principle |
25 | Karsten Weihe |
Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time ![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. 178-189, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
planar networks, maximum (s,t)-flows, directed graphs, planar graph, tree data structures, maximum flow |
25 | Joseph Cheriyan, Torben Hagerup |
A Randomized Maximum-Flow Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 118-123, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
dynamic trees data structure, randomized maximum-flow algorithm, prudent linking excess diminishing, negligible probability, maximum flow excess, PLED algorithm, parameter, worst case, vertex |
24 | Daniel Kobler, Udi Rotics |
Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(4), pp. 327-346, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs |
23 | Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas |
Linear time 3-approximation for the MAST problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 23:1-23:18, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree |
23 | Jinghao Xu, Bojan Peric, Branimir R. Vojcic |
Performance of energy-aware and link-adaptive routing metrics for ultra wideband sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(4), pp. 509-519, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Maximum Forward Progress (MFP), Maximum Information Progress (MIP), Routing metrics |
23 | Ronald I. Greenberg |
Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract). ![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. 528-536, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximum consecutive subsequence sum, maximum-density segments, biomolecular sequence analysis, image processing, bioinformatics, data compression |
23 | Albert M. Vossepoel, Klamer Schutte, Carl F. P. Delanghe |
Memory efficient skeletonization of utility maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 4th International Conference Document Analysis and Recognition (ICDAR '97), 2-Volume Set, August 18-20, 1997, Ulm, Germany, Proceedings, pp. 797-800, 1997, IEEE Computer Society, 0-8186-7898-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
utility maps, overlapping tiles, maximum expected width, maximum size, map components, skeleton part connection, overlap zones, efficient memory utilization, A0 size map, skeletonization, cartography, parallel implementation, memory requirements, Euclidean distance transform |
23 | Hiroshi Saito |
Adaptive CACs using Bayesian performance estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 11, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Bayesian performance estimation, adaptive CAC, Bayesian regression analysis, log-transform, maximum queue length, measurement period, maximum queue size, monitored performance data, simulation, asynchronous transfer mode, asynchronous transfer mode, convergence, queueing theory, ATM networks, variance, oscillation, connection admission control, telecommunication system, cell loss ratio |
23 | Claudio M. Privitera, Réjean Plamondon |
A system for scanning and segmenting cursively handwritten words into basic strokes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 1047-1050, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
cursively handwritten words segmentation, cognitive-behavioral process, motor-temporal information, maximum curvature points, maximum curvature point, smooth interpolation, interior points, motor strokes, interpolation, human subjects, temporal sequence |
23 | Alan Olson, Kang G. Shin |
Fault-Tolerant Clock Synchronization in Large Multicomputer Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(9), pp. 912-923, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
fault-tolerant clock synchronization, large multicomputer systems, clock value, maximum skew, maximum time, fault tolerance, reliability, fault tolerant computing, multiprocessing systems, synchronisation, clocks, clock skew, clock drift, synchronization algorithm |
23 | David M. Nicol |
Optimal Partitioning of Random Programs Across two Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(2), pp. 134-141, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
random programs, homogeneous distributed system, expected maximum, maximum expectation, approximation-free proof, module execution time distribution, parallel programming, distributed processing, programming theory, optimal partitioning |
23 | Eran Halperin, Uri Zwick |
Combinatorial approximation algorithms for the maximum directed cut problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 1-7, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
23 | Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, pp. 438-449, 1999, Springer, 3-540-66251-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Claire Kenyon-Mathieu, Jeffrey Scott Vitter |
General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 473-487, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Joseph S. B. Mitchell |
On Maximum Flows in Polyhedral Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pp. 341-351, 1988, ACM, 0-89791-270-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Malay Bhattacharyya 0001, Sanghamitra Bandyopadhyay |
Solving maximum fuzzy clique problem with neural networks and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Memetic Comput. ![In: Memetic Comput. 1(4), pp. 281-290, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Maximum fuzzy clique problem, Stock flow graph, Collusion set, Neural networks, Fuzzy logic, Gene expression |
23 | Douglas S. Altner, Özlem Ergun |
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings, pp. 283-287, 2008, Springer, 978-3-540-68154-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Reoptimization, Robust Minimum Cut, Maximum Flow |
23 | Jihong Cai, Fei Song 0002 |
Maximum Entropy Modeling with Feature Selection for Text Categorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIRS ![In: Information Retrieval Technology, 4th Asia Infomation Retrieval Symposium, AIRS 2008, Harbin, China, January 15-18, 2008, Revised Selected Papers, pp. 549-554, 2008, Springer, 978-3-540-68633-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Feature Selection, Text Categorization, Maximum Entropy Modeling |
23 | JiaDong Zhang, Kun Yue, Weiyi Liu |
Learning and Inferences of the Bayesian Network with Maximum Likelihood Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 4th International Conference, ADMA 2008, Chengdu, China, October 8-10, 2008. Proceedings, pp. 391-399, 2008, Springer, 978-3-540-88191-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Maximum likelihood hypothesis, Sigmoid, Support vector machine, Bayesian network, Inference |
23 | Ioannis Karydis, Alexandros Nanopoulos, Yannis Manolopoulos |
Finding maximum-length repeating patterns in music databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 32(1), pp. 49-71, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Maximum-length repeating patterns, Theme discovery, Data mining, Music databases |
23 | Alok Singh 0001, Ashok Kumar Gupta |
A hybrid heuristic for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 12(1-2), pp. 5-22, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, Greedy heuristic, Maximum clique, Steady-state genetic algorithm |
23 | Jui-Feng Yeh, Chung-Hsien Wu, Wei-Yen Wu |
Contextual Maximum Entropy Model for Edit Disfluency Detection of Spontaneous Speech. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCSLP ![In: Chinese Spoken Language Processing, 5th International Symposium, ISCSLP 2006, Singapore, December 13-16, 2006, Proceedings, pp. 578-589, 2006, Springer, 3-540-49665-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Disfluency, contextual feature, maximum entropy, spontaneous speech |
23 | Martin Fürer |
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 491-501, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
exponential time algorithm, NP-hard, Maximum independent set, sparse graph |
23 | Ismael García-Varea, Francisco Casacuberta |
Maximum Entropy Modeling: A Suitable Framework to Learn Context-Dependent Lexicon Models for Statistical Machine Translation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 60(1-3), pp. 135-158, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
context-dependent lexicon models, statistical machine translation, maximum entropy modeling |
23 | Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti |
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 102(2), pp. 355-369, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Bottleneck shortest path, Maximum capacity path problem, Sensitivity analysis, Shortest path problem |
23 | Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu |
Maximum Marking Problems with Accumulative Weight Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2005, Second International Colloquium, Hanoi, Vietnam, October 17-21, 2005, Proceedings, pp. 562-578, 2005, Springer, 3-540-29107-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Maximum marking problem, Accumulative weight function, Optimization problem, Program derivation |
23 | Kuan-Yu Chen, Kun-Mao Chao |
On the Range Maximum-Sum Segment Query Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 294-305, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
RMQ, maximum-sum interval, Algorithm, sequence analysis |
23 | Refael Hassin, Shlomi Rubinstein |
An Approximation Algorithm for Maximum Triangle Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 403-413, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
maximum triangle packing, 2-edge paths, Analysis of algorithms |
23 | Christina Peraki, Sergio D. Servetto |
On the maximum stable throughput problem in random networks with directional antennas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2003, Annapolis, Maryland, USA, June 1-3, 2003, pp. 76-87, 2003, ACM, 1-58113-684-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximum stable throughput, wireless networks, network flow, random graphs, directional antennas, multicommodity flow, random networks |
23 | Tom Chau |
Marginal Maximum Entropy Partitioning Yields Asymptotically Consistent Probability Density Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 23(4), pp. 414-417, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Marginal maximum entropy, asymptotic optimal classification, pattern discovery, recursive partitioning |
23 | Song Chun Zhu, Ying Nian Wu, David Mumford |
Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture Modeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 27(2), pp. 107-126, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
texture analysis and synthesis, minimax entropy, feature pursuit, Markov random field, maximum entropy, texture modeling, visual learning |
23 | Ingo Schiermeyer |
Approximating Maximum Independent Set in k-Clique-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 159-168, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
k-Clique, Algorithm, Complexity, Approximation, Graph, Maximum Independent Set |
23 | Sanghyun Ahn, David Hung-Chang Du |
A Multicast Tree Algorithm Considering Maximum Delay Bound for Real-Time Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 21st Conference on Local Computer Networks, Minneapolis, Minnesota, USA, October 13-16, 1996, pp. 172-181, 1996, IEEE Computer Society, 0-8186-7617-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
multicast tree algorithm, maximum delay bound, multiple multicast tree concept, tree maintenance cost, DBMT problem, shortest path tree-based DBMT, minimal Steiner tree-based DBMT, MST DBMT, SPT DBMT, performance analysis, group communication, NP-hardness, heuristic algorithms, real-time applications, multicast routing, telecommunication traffic, real-time traffic |
23 | Chin-Chi Teng, Anthony M. Hill, Sung-Mo Kang |
Estimation of maximum transition counts at internal nodes in CMOS VLSI circuits. ![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. 366-370, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
maximum switching activity, uncertainty waveforms, circuit reliability |
23 | Michael D. McCool, Wolfgang Heidrich, John Stevens |
Interactive Maximum Projection Volume Rendering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Visualization ![In: 6th IEEE Visualization Conference, IEEE Vis 1995, Atlanta, GA, USA, October 29 - November 3, 1995, Proceedings, pp. 11-18, 1995, IEEE Computer Society Press, 0-8186-7187-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
maximum rendering, summation rendering, hardware accelerated rendering, volume visualization, geometric transformation, interactive computer graphics |
23 | Hiroshi Masuyama, Toshihiko Sasama, Hiroyuki Hashimoto |
The maximum dimensional fault-free subcube allocatable in faulty hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 220, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
maximum dimensional fault-free subcube, reconfiguration problem, fault-free (n-2)-subcube, parallel algorithms, hypercube networks, degradation, faulty hypercube, n-cube |
22 | Carlos E. R. Alves, Edson Cáceres, Siang W. Song |
BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PVM/MPI ![In: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 11th European PVM/MPI Users' Group Meeting, Budapest, Hungary, September 19-22, 2004, Proceedings, pp. 139-146, 2004, Springer, 3-540-23163-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Sangwoo Park, Soo Hak Sung, Sangjin Lee 0002, Jongin Lim 0001 |
Improving the Upper Bound on the Maximum Differential and the Maximum Linear Hull Probability for SPN Structures and AES. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24-26, 2003, Revised Papers, pp. 247-260, 2003, Springer, 3-540-20449-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Sándor P. Fekete, Henk Meijer |
Maximum Dispersion and Geometric Maximum Weight Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(3), pp. 501-511, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Remote clique, Heaviest subgraph, Approximation, Facility location, PTAS, Geometric optimization, Dispersion, Maximum weight cliques |
22 | Krishnaram Kenthapadi, Rina Panigrahy |
Balanced allocation on graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 434-443, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Ronald Fagin, Phokion G. Kolaitis, Lucian Popa 0001, Wang Chiew Tan |
Reverse data exchange: coping with nulls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA, pp. 23-32, 2009, ACM, 978-1-60558-553-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
maximum recovery, quasi-inverse, data integration, data exchange, schema mapping, inverse, model management, chase |
21 | Doron Blatt, Alfred O. Hero III |
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, 4th International Workshop, EMMCVPR 2003, Lisbon, Portugal, July 7-9, 2003, Proceedings, pp. 164-179, 2003, Springer, 3-540-40498-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
clustering, sensor networks, data fusion, mixture models, Maximum likelihood |
21 | Hyunmin Park, Dharma P. Agrawal |
A novel deadlock-free routing technique for a class of de Bruijn graph based networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 524-531, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
deadlock-free routing technique, de Bruijn graph based networks, maximum message path length, dBCube graph, outcluster channels, cluster-to-cluster path, concurrency control, hypercube networks, virtual channels |
21 | Andreas Brandstädt, Raffaele Mosca |
On Distance-3 Matchings and Induced Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 116-126, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Distance-k matching, Maximum Distance-k Matching Problem, Maximum Induced Matching Problem, chordal graphs |
21 | Sinisa Todorovic, Narendra Ahuja |
Region-Based Hierarchical Image Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 78(1), pp. 47-66, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Edit-distance graph matching, Many-to-many matching, Maximum subtree isomorphism, Image matching, Transitive closures, Segmentation trees, Maximum weight cliques, Association graphs |
21 | Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Hai-Son Le, Vijaya Ramachandran, Tandy J. Warnow |
Pattern Identification in Biogeography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(4), pp. 334-346, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Biogeography, area cladograms, maximum agreement area cladogram, maximum agreement subset, distance metrics |
21 | Serkan Hosten, Amit Khetan, Bernd Sturmfels |
Solving the Likelihood Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 5(4), pp. 389-407, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Maximum likelihood degree, Syzygies, Maximum likelihood, Phylogenetic trees |
21 | Tsung-I Lin, Jack C. Lee, Huey F. Ni |
Bayesian analysis of mixture modelling using the multivariate t distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stat. Comput. ![In: Stat. Comput. 14(2), pp. 119-130, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
t mixture model, maximum likelihood estimation, MCMC, maximum a posteriori, ECM, ECME |
21 | Rómer Rosales, Stan Sclaroff |
Specialized Mappings and the Estimation of Human Body Pose from a Single Image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Human Motion ![In: Workshop on Human Motion, HUMO 2000, Austin, Texas, USA, December 7-8, 2000, Proceedings, pp. 19-24, 2000, IEEE Computer Society, 0-7695-0939-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
human body pose esimation, articulated body pose, monocular images, Specialized Mappings Architecture, nonlinear supervised learning architecture, forward mapping functions, feedback matching function, computer vision, learning (artificial intelligence), probability, image recognition, probabilistic model, maximum likelihood estimation, maximum likelihood estimation, expectation maximization |
Displaying result #1 - #100 of 35463 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|