|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11526 occurrences of 4704 keywords
|
|
|
Results
Found 29774 publication records. Showing 29763 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz |
Improved second-order bounds for prediction with expert advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 66(2-3), pp. 321-352, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Individual sequences, Prediction with expert advice, Exponentially weighted averages |
19 | Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Poor |
Finite-Dimensional Bounds on BBZm and Binary LDPC Codes With Belief Propagation Decoders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(1), pp. 56-81, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Zihuai Lin, Tor Aulin |
On Joint Source and Channel Coding Using Trellis Coded CPM: Analytical Bounds on the Channel Distortion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(9), pp. 3081-3094, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Susana Díaz, Susana Montes, Bernard De Baets |
Transitivity Bounds in Additive Fuzzy Preference Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 15(2), pp. 275-286, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Alireza Keshavarz-Haddad, Rudolf H. Riedi |
Bounds for the capacity of wireless multihop networks imposed by topology and demand. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, Montreal, Quebec, Canada, September 9-14, 2007, pp. 256-265, 2007, ACM, 978-1-59593-684-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
capacity of wireless networks, transport capacity |
19 | Nati Linial, Adi Shraibman |
Lower bounds in communication complexity based on factorization norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 699-708, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
factorization norms, communication complexity, discrepancy, Fourier analysis |
19 | Amit Chakrabarti |
Lower Bounds for Multi-Player Pointer Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 33-45, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Ryan Williams 0001 |
Inductive Time-Space Lower Bounds for Sat and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(4), pp. 433-470, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
19 | Yael Ben-Haim, Simon Litsyn |
Upper bounds on the rate of LDPC codes as a function of minimum distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(5), pp. 2092-2100, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Tong Zhang 0001 |
Information-theoretic upper and lower bounds for statistical estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(4), pp. 1307-1321, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Giuliano Casale, Richard R. Muntz, Giuseppe Serazzi |
A New Class of Non-Iterative Bounds for Closed Queueing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: 14th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2006), 11-14 September 2006, Monterey, California, USA, pp. 69-76, 2006, IEEE Computer Society, 0-7695-2573-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Mihai Patrascu, Mikkel Thorup |
Higher Lower Bounds for Near-Neighbor and Further Rich Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 646-654, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Ioannis Kontoyiannis, Luis Alfonso Lastras-Montaño, Sean P. Meyn |
Exponential bounds and stopping rules for MCMC and general Markov chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VALUETOOLS ![In: Proceedings of the 1st International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2006, Pisa, Italy, October 11-13, 2006, pp. 45, 2006, ACM, 1-59593-504-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Vivek N. Darera, Lawrence Jenkins |
Utilization Bounds for RM Scheduling on Uniform Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 12th IEEE Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2006), 16-18 August 2006, Sydney, Australia, pp. 315-321, 2006, IEEE Computer Society, 0-7695-2676-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Sophie Laplante |
Lower Bounds Using Kolmogorov Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 297-306, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Iannis Tourlakis |
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 170-182, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Arindam Banerjee 0001 |
On Bayesian bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006, pp. 81-88, 2006, ACM, 1-59593-383-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Vebjorn Ljosa, Arnab Bhattacharya 0001, Ambuj K. Singh |
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Advances in Database Technology - EDBT 2006, 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006, Proceedings, pp. 865-883, 2006, Springer, 3-540-32960-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Andrea Conti 0001, Moe Z. Win, Marco Chiani |
Invertible bounds for M-QAM in Rayleigh fading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 4(5), pp. 1994-2000, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Jun (Jim) Xu, Richard J. Lipton |
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 13(1), pp. 15-28, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
quality of service, computational complexity, decision tree, packet scheduling, delay bound |
19 | Ingmar Land, Simon Huettinger, Peter A. Hoeher, Johannes B. Huber |
Bounds on information combining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(2), pp. 612-619, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Gal Ben-David, David Malah |
Bounds on the performance of vector-quantizers under channel errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(6), pp. 2227-2235, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Radu Rugina, Martin C. Rinard |
Symbolic bounds analysis of pointers, array indices, and accessed memory regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 27(2), pp. 185-235, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
static race detection, parallelization, Symbolic analysis |
19 | Omer Horvitz, Jonathan Katz |
Bounds on the Efficiency of "Black-Box" Commitment Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 128-139, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Tong Zhang 0001 |
Localized Upper and Lower Bounds for Some Estimation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings, pp. 516-530, 2005, Springer, 3-540-26556-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Ryan Williams 0001 |
Better Time-Space Lower Bounds for SAT and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 40-49, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Antanas Zilinskas, Julius Zilinskas |
On Efficiency of Tightening Bounds in Interval Global Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing, State of the Art in Scientific Computing, 7th International Workshop, PARA 2004, Lyngby, Denmark, June 20-23, 2004, Revised Selected Papers, pp. 197-205, 2004, Springer, 3-540-29067-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Shengyu Zhang |
On the Power of Ambainis's Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 1238-1250, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | József Bíró, András Gulyás, Tamás Szénási, Zalán Heszberger |
Distribution-free conservative bounds for QoS measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28 - July 1, 2004, Alexandria, Egypt, pp. 915-920, 2004, IEEE Computer Society, 0-7803-8623-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Peter T. Popov, Lorenzo Strigini, John H. R. May, Silke Kuball |
Estimating Bounds on the Reliability of Diverse Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 29(4), pp. 345-359, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
demand space partitioning, subdomain testing, common-mode failure, Software fault-tolerance, design diversity |
19 | George S. Lueker |
Improved bounds on the average length of longest common subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 130-131, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
19 | Ludmila I. Kuncheva |
Error Bounds for Aggressive and Conservative AdaBoost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multiple Classifier Systems ![In: Multiple Classifier Systems, 4th International Workshop, MCS 2003, Guilford, UK, June 11-13, 2003, Proceedings, pp. 25-34, 2003, Springer, 3-540-40369-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | David A. McAllester |
Simplified PAC-Bayesian Margin Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedings, pp. 203-215, 2003, Springer, 3-540-40720-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Leah Epstein, Steven S. Seiden, Rob van Stee |
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 306-317, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Ziv Bar-Yossef, Ravi Kumar 0001, D. Sivakumar 0001 |
Sampling algorithms: lower bounds and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 266-275, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich |
New Spectral Lower Bounds on the Bisection Width of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 23-34, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Radu Rugina, Martin C. Rinard |
Symbolic bounds analysis of pointers, array indices, and accessed memory regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Vancouver, Britith Columbia, Canada, June 18-21, 2000, pp. 182-195, 2000, ACM, 1-58113-199-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | David R. Wood |
Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings, pp. 259-271, 2000, Springer, 3-540-41554-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Sumant Ramprasad, Naresh R. Shanbhag, Ibrahim N. Hajj |
Information-theoretic bounds on average signal transition activity [VLSI systems]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 7(3), pp. 359-368, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Vladimir Cherkassky, Xuhui Shao, Filip Mulier, Vladimir Vapnik |
Model complexity control for regression using VC generalization bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 10(5), pp. 1075-1089, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | David P. Helmbold, Jyrki Kivinen, Manfred K. Warmuth |
Relative loss bounds for single neurons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 10(6), pp. 1291-1304, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Rajamohana Hegde, Naresh R. Shanbhag |
Lower bounds on energy dissipation and noise-tolerance for deep submicron VLSI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (6) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 334-337, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Nicolas Vayatis, Robert Azencott |
Distribution-Dependent Vapnik-Chervonenkis Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroCOLT ![In: Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings, pp. 230-240, 1999, Springer, 3-540-65701-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Vince Grolmusz, Gábor Tardos |
Lower Bounds for (MOD p - MOD m) Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 279-289, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Juraj Hromkovic |
Communication Complexity and Lower Bounds on Multilective Computations. ![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. 789-797, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Bertrand Cabon, Simon de Givry, Gérard Verfaillie |
Anytime Lower Bounds for Constraint Violation Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP98, 4th International Conference, Pisa, Italy, October 26-30, 1998, Proceedings, pp. 117-131, 1998, Springer, 3-540-65224-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Zhen Liu 0001, Philippe Nain, Donald F. Towsley |
Exponential bounds with applications to call admission. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(3), pp. 366-394, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
exponential bound, matrix analysis, tail distribution, Markov chain, call admission control, queues, effective bandwidth, ergodicity, Markov additive process, large deviation principle |
19 | Jeff Erickson 0001 |
New Lower Bounds for Hopcroft's Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 16(4), pp. 389-418, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini |
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 309-318, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Kaoru Kurosawa, Satoshi Obana |
Combinatorial Bounds for Authentication Codes with Arbitration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '95, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21-25, 1995, Proceeding, pp. 289-300, 1995, Springer, 3-540-59409-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Michael Mitzenmacher |
Bounds on the Greedy Routing Algorithm for Array Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '94, Cape May, New Jersey, USA, June 27-29, 1994, pp. 346-353, 1994, ACM, 0-89791-671-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Vladimir I. Levenshtein |
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993, Proceedings, pp. 25-42, 1993, Springer, 3-540-56686-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Hagit Attiya, Taly Djerassi-Shintel |
Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings, pp. 204-218, 1993, Springer, 3-540-57271-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Hai-Ping Ko, Mark E. Nadel |
Elementary Lower Bounds for th Length of Refutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning,International Conference LPAR'92, St. Petersburg, Russia, July 15-20, 1992, Proceedings, pp. 137-147, 1992, Springer, 3-540-55727-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Warren H. Debany Jr., Carlos R. P. Hartmann |
Bounds on the sizes of irredundant test sets and sequences for combinational logic networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 2(4), pp. 325-338, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Digital logic testing, irredundant tests, test complexity, test counting |
19 | Soma Chaudhuri, Jennifer L. Welch |
Bounds on the Costs of Register Implementations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings, pp. 402-421, 1990, Springer, 3-540-54099-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
19 | Ming Li 0001, Yaacov Yesha |
New lower bounds for parallel computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 36(3), pp. 671-680, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
19 | Juraj Hromkovic, Juraj Procházka |
Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 360-370, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
19 | Ashok K. Chandra, Steven Fortune, Richard J. Lipton |
Lower Bounds for Constant Depth Circuits for Prefix Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings, pp. 109-117, 1983, Springer, 3-540-12317-2. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
19 | Nai-Kuan Tsao |
Some a Posteriori Error Bounds in Floating-Point Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 21(1), pp. 6-17, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
16 | Hagit Attiya |
The inherent complexity of transactional memory and what to do about it. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 1-5, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
mini-transactions, lower bounds, transactional memory |
16 | Lou van den Dries, Yiannis N. Moschovakis |
Arithmetic complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(1), pp. 2:1-2:49, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Lower bounds for arithmetical problems, coprimeness, greatest common divisor, recursive programs |
16 | Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov |
The complexity of obstruction-free implementations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(4), pp. 24:1-24:33, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
perturbable objects, solo-fast implementations, step contention, lower bounds, Shared memory, memory contention |
16 | András Horváth, Sándor Rácz, Miklós Telek |
Moments Characterization of Order 3 Matrix Exponential Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASMTA ![In: Analytical and Stochastic Modeling Techniques and Applications, 16th International Conference, ASMTA 2009, Madrid, Spain, June 9-12, 2009. Proceedings, pp. 174-188, 2009, Springer, 978-3-642-02204-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Matrix exponential distributions, moment bounds, Phase type distributions |
16 | John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi |
Brief announcement: collaborative measurement of upload speeds in P2P systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 338-339, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
lower bounds, P2P systems, bandwidth estimation |
16 | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport |
Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 330-331, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
lower bounds, broadcast |
16 | Eyal Kushilevitz, Enav Weinreb |
On the complexity of communication complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 465-474, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
protocol tree, lower bounds, communication complexity, hardness of approximation, pseudo random functions |
16 | Jeff Abrahamson, Béla Csaba, Ali Shokoufandeh |
Optimal Random Matchings on Trees and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 254-265, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Random Matching, Hierarchically Separated Trees, Supremum Bounds |
16 | Robert Spalek |
The Multiplicative Quantum Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 237-248, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems |
16 | Nicolas Christin, Jörg Liebeherr, Tarek F. Abdelzaher |
Enhancing class-based service architectures with adaptive rate allocation and dropping mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(3), pp. 669-682, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
best-effort bounds, scheduling, buffer management, feedback control, service differentiation |
16 | Peter Auer, Ronald Ortner |
A new PAC bound for intersection-closed concept classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 66(2-3), pp. 151-163, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
PAC bounds, Intersection-closed classes |
16 | César Luis Alonso, José Luis Montaña |
Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 18th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings, pp. 107-119, 2007, Springer, 978-3-540-75224-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Milnor-Thom bounds, formula size, parallel computation, Concept learning, Vapnik-Chervonenkis dimension |
16 | Faith Ellen Fich, Danny Hendler, Nir Shavit |
On the inherent weakness of conditional primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(4), pp. 267-277, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Space lower bounds, Object implementations, Mutual exclusion, Conditionals |
16 | Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi |
Byzantine disk paxos: optimal resilience with byzantine shared memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(5), pp. 387-408, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
T-tolerant object implementations, Lower bounds, Consensus, Byzantine failures, Wait freedom, Shared-memory emulations |
16 | David Liben-Nowell, Erik Vee, An Zhu |
Finding longest increasing and common subsequences in streaming data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(2), pp. 155-175, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Data-streaming model, Algorithms, Lower bounds, LCS, LIS |
16 | Armin Heindl, Gábor Horváth 0002, Karsten Gross |
Explicit Inverse Characterizations of Acyclic MAPs of Second Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPEW ![In: Formal Methods and Stochastic Models for Performance Evaluation, Third European Performance Engineering Workshop, EPEW 2006, Budapest, Hungary, June 21-22, 2006, Proceedings, pp. 108-122, 2006, Springer, 3-540-35362-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Acyclic Markovian arrival processes of second order, inverse characterization, moment and correlation bounds |
16 | Hans Georg Schaathun, Gérard D. Cohen |
A Trellis-Based Bound on (2, 1)-Separating Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 10th IMA International Conference, Cirencester, UK, December 19-21, 2005, Proceedings, pp. 59-67, 2005, Springer, 3-540-30276-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
coding bounds, separating codes, Trellis |
16 | Tarek F. Abdelzaher, Vivek Sharma 0004, Chenyang Lu 0001 |
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(3), pp. 334-350, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks |
16 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
What cannot be computed locally! ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 300-309, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation hardness, distributed algorithms, locality, lower bounds, dominating set, vertex cover, maximal independent set, maximal matching |
16 | Peter L. Bartlett, Shahar Mendelson, Petra Philips |
Local Complexities for Empirical Risk Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings, pp. 270-284, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
concentration inequalities, isomorphic coordinate projections, data-dependent complexity, Statistical learning theory, empirical risk minimization, generalization bounds |
16 | Xavier Dahan, Éric Schost |
Sharp estimates for triangular sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 103-110, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
intrinsic bounds, polynomial systems, triangular sets |
16 | Micah Adler, Neil Immerman |
An n! lower bound on formula size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 4(3), pp. 296-314, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
lower bounds, temporal logic, Descriptive complexity |
16 | Eunice E. Santos |
Parallel Complexity of Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 25(2), pp. 155-175, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
optimality, parallel algorithms, lower bounds, matrix multiplication, linear algebra, numerical algorithms, parallel models, parallel complexity, LogP model |
16 | Faith E. Fich, Eric Ruppert |
Hundreds of impossibility results for distributed computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 16(2-3), pp. 121-163, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Complexity lower bounds, Distributed computing, Impossibility results |
16 | Rohit Ananthakrishna, Abhinandan Das, Johannes Gehrke, Flip Korn, S. Muthukrishnan 0001, Divesh Srivastava |
Efficient Approximation of Correlated Sums on Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(3), pp. 569-572, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Correlated aggregates, summary structures, a priori error bounds, IP network management, approximation, data streams |
16 | Philipp Woelfel |
On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 80-89, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Lower Bounds, BDDs, Nondeterminism, Branching Programs, Integer Multiplication |
16 | Stefanie Gerke, Colin McDiarmid |
Channel Assignment with Large Demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 107(1-4), pp. 143-159, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
graph imperfection, clique-bounds, channel assignment |
16 | Beate Bollig, Philipp Woelfel |
A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 419-424, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
read-once branching programs, computational complexity, lower bounds, integer multiplication |
16 | Fritz Henglein, Jakob Rehof |
The Complexity of Subtype Entailment for Simple Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 352-361, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
subtype entailment complexity, atomic entailment, coNP-completeness, complexity-theoretic marker, exponential explosion, subtype inference, structural complexity bounds, computability, satisfiability, axiomatization, linear-time algorithm |
16 | Andrew V. Goldberg, Satish Rao |
Beyond the Flow Decomposition Barrier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 2-11, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
flow decomposition barrier, arc lengths, Gomory-Hu tree problem, parametric flow problem, time bound, time bounds, combinatorial mathematics, maximum flow problem |
16 | Mei-Hwey Hou, Chienhua Chen |
Service disciplines for guaranteed performance service. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 4th International Workshop on Real-Time Computing Systems and Applications (RTCSA '97), 27-29 October 1997, Taipei, Taiwan, pp. 244-, 1997, IEEE Computer Society, 0-8186-8073-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
guaranteed performance service, packet service disciplines, traffic dynamics, fairness property, hierarchical packet fair queuing algorithm, packet switching, delay bounds, networking environment, service disciplines, end-to-end performance |
16 | Samit Chaudhuri, Stephen A. Blythe, Robert A. Walker 0001 |
An exact methodology for scheduling in a 3D design space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSS ![In: Proceedings of the 8th International Symposium on System Synthesis (ISSS 1995), September 13-15, 1995, Cannes, France, pp. 78-83, 1995, ACM, 0-89791-771-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
2D design space, 3D design space, 3D scheduling problem, Voyager design space exploration system, candidate clock lengths, clock length, globally optimal solution, schedule length, three dimensional scheduling, three-dimensional design space, two dimensional design space, scheduling, optimisation, high level synthesis, search problems, clocks, tight bounds, network synthesis, search space pruning |
16 | David A. Cohn, Eve A. Riskin, Richard E. Ladner |
Theory and Practice of Vector Quantizers Trained on Small Training Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(1), pp. 54-65, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
small training sets, memoryless vector quantizer, training set distortion, test distortion, training image, formal bounds, vector quantizer codebooks, empirical simulations, image coding, statistics, learning systems, vector quantisation, Vapnik-Chervonenkis dimension |
16 | Jop F. Sibeyn, Michael Kaufmann 0001, Rajeev Raman |
Randomized Routing on Meshes with Buses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 333-344, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
algorithms, parallel computation, lower bounds, meshes, randomization, coloring, packet routing, buses |
16 | Valmir Carneiro Barbosa |
Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(11), pp. 1311-1316, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
randomly generated systems, distributed parallel programs, unavailability, message buffers, message buffering space, buffer usage, NP-hard optimization problems, computational complexity, parallel programming, concurrency, heuristic, upper bounds, programming theory, communication channels, deadlock prevention, process execution, communication deadlocks |
16 | Eric Blais, Ryan O'Donnell |
Lower Bounds for Testing Function Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 235-246, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
lower bounds, Boolean functions, property testing |
16 | Vivek Dua, Efstratios N. Pistikopoulos |
Bounds and Solution Vector Estimates for Parametric NLPS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 325-328, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Parametric upper and lower bounds, Sensitivity analysis, Linear approximation |
16 | Michael Navon, Alex Samorodnitsky |
Linear Programming Bounds for Codes via a Covering Argument. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 199-207, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Linear programming bounds for codes, Discrete Fourier transform |
16 | Liming Yang, Laisheng Wang, Yitian Xu, Qun Sun |
Time Series Prediction Based on Generalization Bounds for Support Vector Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (2) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part II, pp. 322-326, 2009, Springer, 978-3-642-01509-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
VC bounds, SVM, Time series prediction, AR model |
16 | Keqiao Yang, Zeng Huang, Min Yang |
Array Bounds Check Elimination for Java Based on Sparse Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SERA ![In: Proceedings of the Seventh ACIS International Conference on Software Engineering Research, Management and Applications, SERA 2009, Haikou, China, 2-4 December 2009, pp. 189-196, 2009, IEEE Computer Society, 978-0-7695-3903-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
array bounds check elimination, Java, optimization, performance |
Displaying result #401 - #500 of 29763 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|