|
|
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 |
20 | Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan |
Competitive Algorithms for Layered Graph Traversal ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 288-297, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
deterministic online algorithm, layered graph traversal, searcher, target vertex, lower bounds, upper bounds, weighted graph, competitive algorithms |
20 | Karl R. Abrahamson |
A Time-Space Tradeoff for Boolean Matrix Multiplication ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 412-419, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
branching program model, lower bounds, upper bounds, deterministic algorithm, semiring, time-space tradeoff, Boolean matrix multiplication |
20 | Edward A. Bender, Jon T. Butler |
On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(1), pp. 82-98, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
product terms, nonzero output values, PLA size, realizable functions, lower bounds, logic design, upper bounds, variance, switching functions, logic arrays, minimisation of switching nets, multiple-valued functions |
20 | Gary L. Miller, Joseph Naor |
Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) ![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. 112-117, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
multiple sources, planar network, exclusive-read-exclusive-write parallel random-access machine, edge capacities, lower bounds, time complexity, planar graphs, upper bounds, face, maximum flow, EREW PRAM, demand, sinks |
20 | Michael L. Fredman, Deborah L. Goldsmith |
Three Stacks ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 514-523, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
lower complexity bounds, upper complexity bounds, three stacks, additional time, additional space, memory, collisions, storage allocation, pointers, linked lists, relocating |
19 | Shai Ben-David, Reba Schuller Borbely |
A notion of task relatedness yielding provable multiple-task learning guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 73(3), pp. 273-287, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Classification prediction, Task relatedness, Learning theory, VC-dimension, Multi-task learning, Inductive transfer, Generalization bounds |
19 | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum |
Bit complexity of breaking and achieving symmetry in chains and rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(1), pp. 3:1-3:28, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bit complexity, processor chain, processor ring, symmetric synchronous execution, Distributed computing, lower bounds, consensus, communication complexity, leader election, communication cost, message complexity, tight bound |
19 | Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile |
Tracking the best hyperplane with a simple budget Perceptron. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 143-167, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mistake bounds, Budget algorithms, Pattern classification, Perceptron algorithm |
19 | Peter Høyer, Troy Lee, Robert Spalek |
Negative weights make adversaries stronger. ![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. 526-535, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
adversary method, certificate complexity barrier, formula size, quantum query complexity, lower bounds, quantum computing |
19 | Therese C. Biedl, Torsten Thiele, David R. Wood |
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(3), pp. 233-255, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Lower bounds, Graph drawing, Three-dimensional, Orthogonal |
19 | Daler N. Rakhmatov |
Energy budgeting for battery-powered sensors with a known task schedule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2006 International Conference on Computer-Aided Design, ICCAD 2006, San Jose, CA, USA, November 5-9, 2006, pp. 765-771, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
battery voltage modeling, energy bounds, low-power design |
19 | Zhihua Xiong, Jie Zhang 0005 |
Optimal Control of Fed-Batch Processes Based on Multiple Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 22(2), pp. 149-161, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
multiple neural networks, confidence bounds, optimal control, batch processes |
19 | Menelaos I. Karavelas, Panagiotis D. Kaklis, Konstantinos V. Kostas |
Bounding the Distance between 2D Parametric Bézier Curves and their Control Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 72(1-2), pp. 117-128, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Parametric Bézier curves, control polygon, polygonal envelopes, bounding region, optimal-orientation bounds, collision detection |
19 | Sylvain Pion, Chee-Keng Yap |
Constructive root bound for k-ary rational input numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 256-263, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
constructive root bounds, k-ary rational numbers, robust numerical algorithms, exact geometric computation |
19 | Kazuyuki Amano, Akira Maruoka |
Some Properties of MODm Circuits Computing Simple Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, pp. 227-237, 2003, Springer, 3-540-40176-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
modular circuits, composite modulus, lower bounds, Fourier analysis, symmetric functions |
19 | Anita Amberg, Stefan Voß 0001 |
A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 35th Hawaii International Conference on System Sciences (HICSS-35 2002), CD-ROM / Abstracts Proceedings, 7-10 January 2002, Big Island, HI, USA, pp. 83, 2002, IEEE Computer Society, 0-7695-1435-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Capacitated arc routing problem, lower bounds, transportation, vehicle routing |
19 | Knut Petras |
On the Smolyak cubature error for analytic functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 12(1), pp. 71-93, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Smolyak algorithm, Clenshaw-Curtis quadrature, Kronrod-Patterson quadrature, 41A55, error bounds, 41A63, 65D32, cubature, 65D30, analytic functions |
19 | Eric Allender, Michael E. Saks, Igor E. Shparlinski |
A Lower Bound for Primality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 10-14, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Circuit Complexity Lower Bounds, Primality, Square-Free Numbers, GCD |
19 | Ran Raz, Pierre McKenzie |
Separation of the Monotone NC Hierarchy. ![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. 234-243, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
monotone NC hierarchy, tight lower bounds, monotone depth, DART games, communication complexity, communication complexity, search problems, monotone Boolean function |
19 | Maria Luisa Bonet, Toniann Pitassi, Ran Raz |
No Feasible Interpolation for TC0-Frege Proofs. ![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. 254-263, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
TC/sup 0/-Frege proofs, feasible interpolation, complexity-theoretic assumption, hardness assumption, lower bounds, theorem proving, Chinese Remainder Theorem, proof systems |
19 | Ti-Yen Yen, Wayne H. Wolf |
Performance estimation for real-time distributed embedded systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 64-71, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
real-time distributed embedded systems, efficient analysis algorithm, application task, cosynthesis algorithms, bounding algorithms, performance evaluation, real-time systems, distributed processing, ASICs, data dependencies, execution time, performance estimation, CPUs, tight bounds, communication links |
19 | Kenneth W. Fertig, John S. Breese |
Probability Intervals Over Influence Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(3), pp. 280-286, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Bayesian conditioning, point-valued probabilistic inference mechanisms, computational complexity, lower bounds, probability, sensitivity analysis, sensitivity analysis, inference mechanisms, Bayes methods, probability distributions, probabilistic reasoning, uncertainty handling, influence diagrams, probabilistic queries, conditional expectation |
19 | Ramakrishna Kakarala, Alfred O. Hero III |
On Achievable Accuracy in Edge Localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 14(7), pp. 777-781, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
S/N ratio, achievable accuracy, statistical parameter estimation, image coordinates, Canny algorithm, pattern recognition, pattern recognition, picture processing, picture processing, sampling, parameter estimation, statistical analysis, maximum-likelihood estimator, quantization, filtering and prediction theory, image intensity, smoothing filter, edge localization, Cramer-Rao bounds |
19 | Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen |
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 240-246, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
orthogonal range reporting, pointer machine, data structures, lower bounds |
19 | Andrew Richards |
On upper bounds for the tail distribution of geometric sums of subexponential random variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 62(3), pp. 229-242, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Geometric sum, GI/GI/1, Upper bounds, Subexponential distribution |
19 | Vladimir Lipets |
Bounds on Mincut for Cayley Graphs over Abelian Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 372-380, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mincut, Algorithms, Graph theory, Combinatorial optimization, Bounds, Cayley graphs, Bisection |
19 | Xiankun Zhang, Minghu Ha 0001, Jing Wu, Chao Wang 0034 |
The Bounds on the Rate of Uniform Convergence of Learning Process on Uncertainty Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part I, pp. 110-117, 2009, Springer, 978-3-642-01506-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Uncertain measure, Expected risk functional, Empirical risk functional, Empirical risk minimization principle, Bounds of the rate of uniform convergence |
19 | Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper 0001 |
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, pp. 91-100, 2009, ACM, 978-1-60558-606-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
scheduling, work stealing, futures, performance bounds |
19 | Yehuda Lindell |
Lower Bounds and Impossibility Results for Concurrent Self Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 21(2), pp. 200-249, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Self and general composition, Non-black-box and black-box simulation, Lower bounds, Secure computation, Protocol composition, Impossibility results |
19 | Beate Bollig, Niko Range, Ingo Wegener |
Exact OBDD Bounds for Some Fundamental Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp. 174-185, 2008, Springer, 978-3-540-77565-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Computational complexity, lower bounds, ordered binary decision diagrams |
19 | Adam R. Klivans, Alexander A. Sherstov |
Unconditional lower bounds for learning intersections of halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 97-114, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions |
19 | Jiangzhuo Chen, Robert D. Kleinberg, László Lovász 0001, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
(Almost) Tight bounds and existence theorems for single-commodity confluent flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(4), pp. 16, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
confluent flow, routing, Approximation algorithms, network flow, tight bounds |
19 | Hoeteck Wee |
Lower Bounds for Non-interactive Zero-Knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings, pp. 103-117, 2007, Springer, 3-540-70935-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
set-up assumptions, lower bounds, Non-interactive zero-knowledge |
19 | Mark Nicholas Charles Rhodes |
Rank Lower Bounds for the Sherali-Adams Operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 648-659, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Lift and Project Proof Systems, Rank Lower Bounds, Sherali-Adams Relaxation, Propositional Proof Complexity |
19 | Alkiviadis G. Akritas, Adam W. Strzebonski, Panagiotis S. Vigklas |
Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 78(4), pp. 355-367, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
positive roots, polynomial real root isolation, Upper bounds |
19 | Carsten Schneider |
Degree Bounds to Find Polynomial Solutions of Parameterized Linear Difference Equations in Pi-Sigma-Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 16(1), pp. 1-32, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Linear Difference Equations, ??-Fields, Degree Bounds |
19 | Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano |
The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 10, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Data path merging, heuristics, lower bounds, reconfigurable systems |
19 | Anand M. Narasimhamurthy |
Theoretical Bounds of Majority Voting Performance for a Binary Classification Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 27(12), pp. 1988-1995, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
theoretical bounds, classifier diversity measures, Majority voting, Classifier design and evaluation |
19 | Floris Geerts, Bart Goethals, Jan Van den Bussche |
Tight upper bounds on the number of candidate patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 30(2), pp. 333-363, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Data mining, upper bounds, frequent patterns |
19 | Fen Xie, Margaret Martonosi, Sharad Malik |
Bounds on power savings using runtime dynamic voltage scaling: an exact algorithm and a linear-time heuristic approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 2005 International Symposium on Low Power Electronics and Design, 2005, San Diego, California, USA, August 8-10, 2005, pp. 287-292, 2005, ACM, 1-59593-137-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounds on energy savings, low power, dynamic voltage scaling, linear time |
19 | Scott Aaronson, Yaoyun Shi |
Quantum lower bounds for the collision and the element distinctness problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(4), pp. 595-605, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
element distinctness, polynomial method, quantum lower bounds, quantum computing, Collision |
19 | Arnold Neumaier, Oleg Shcherbina |
Safe bounds in linear and mixed-integer linear programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 99(2), pp. 283-296, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
directed rounding, mixed-integer rounding, generalized Gomory cut, safe cuts, safe presolve, certificate of infeasibility, lower bounds, linear programming, mixed-integer programming, interval arithmetic, branch-and-cut, rounding errors |
19 | Jiangzhuo Chen, Robert D. Kleinberg, László Lovász 0001, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
(Almost) tight bounds and existence theorems for confluent flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 529-538, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
confluent flow, routing, approximation algorithms, network flow, tight bounds |
19 | Peter Brucker, Sigrid Knust |
Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 115(1-4), pp. 147-172, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
traveling salesman problem with time windows, scheduling, lower bounds, constraint propagation, column generation, time-lags |
19 | Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas |
On a model of indexability and its bounds for range queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(1), pp. 35-55, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Database, lower bounds, indexability, redundancy, query, index, multidimensional |
19 | Michael A. Frumkin, Rob F. Van der Wijngaart |
Tight bounds on cache use for stencil operations on rectangular grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(3), pp. 434-453, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
fundamental parallelepiped, lower and upper bounds, reduced basis, structured grids, scientific computing, lattice, Cache memory, cache misses |
19 | Peter G. Bishop |
Rescaling reliability bounds for a new operational profile. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the International Symposium on Software Testing and Analysis, ISSTA 2002, Roma, Italy, July 22-24, 2002, pp. 180-190, 2002, ACM, 1-58113-562-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
operational reliability testing, operational profile, worst case bounds |
19 | Christian Jansson |
Rigorous Error Bounds for the Optimal Value of Linear Programming Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOS ![In: Global Optimization and Constraint Satisfaction, First International Workshop Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002, Revised Selected Papers, pp. 59-70, 2002, Springer, 3-540-20463-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
rigorous error bounds, linear programming, branch-and-bound, sensitivity analysis, interval arithmetic |
19 | Markus Krabbes, Christian Döschner |
Experimental Estimation of Model Error Bounds Based on Modified Stochastic Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 32(2), pp. 207-218, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
feedback linearisation, robust controller design, estimation of error bounds, stochastic approximation, robustness analysis |
19 | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf |
Quantum lower bounds by polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(4), pp. 778-797, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
polynomial method, lower bounds, Quantum computing, query complexity, black-box model |
19 | Saul Abarbanel, Adi Ditkowski, Bertil Gustafsson |
On Error Bounds of Finite Difference Approximations to Partial Differential Equations - Temporal Behavior and Rate of Convergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 15(1), pp. 79-116, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
error bounds, finite difference |
19 | Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi |
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 12th International Conference on Scientific and Statistical Database Management, Berlin, Germany, July 26-28, 2000, pp. 95-108, 2000, IEEE Computer Society, 0-7695-0686-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
approximation with error bounds, interactive statistical analysis, efficient updates, OLAP, online aggregation |
19 | Arie Harel, Su Namn, Jacob Sturm |
Simple bounds for closed queueing networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 31(1-2), pp. 125-135, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
balanced job bounds, complete symmetric function, mean performance measures, lower bound, throughput, upper bound, majorization, closed queueing networks, normalization constant |
19 | Sascha Ott |
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 55-64, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Superstrings, lower bounds, approximability, APX-hardness |
19 | Jacobo Torán |
Lower Bounds for Space in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, pp. 362-373, 1999, Springer, 3-540-66536-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Resolution, space, complexity measures, pebbling game |
19 | Dima Grigoriev |
Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. ![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. 648-652, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Nullstellensatz proofs, Tseitin's tautologies, lower bounds, expander |
19 | Marc Fischlin |
Lower Bounds for the Signature Size of Incremental Schemes. ![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. 438-447, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
incremental schemes, signature size, substitution attacks, single block replacement, lower bounds, security of data |
19 | Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan |
Nearly Tight Bounds on the Learnability of Evolution. ![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. 524-533, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
nearly tight bounds, evolution learnability, Cavender-Farris trees, edge weighted trees, Phylogeny Construction Problem, CF tree, computationally expensive, genetic algorithms, maximum likelihood estimator, stochastic process, DNA, convergence rate, random variable |
19 | Valeriu Beiu |
Enhanced lower entropy bounds with application to constructive learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 23rd EUROMICRO Conference '97, New Frontiers of Information Technology, 1-4 September 1997, Budapest, Hungary, pp. 541-548, 1997, IEEE Computer Society, 0-8186-8129-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
enhanced lower entropy bounds, IR/sup n/, constructive learning algorithms, n dimensional ball, integer weights, maximum volume, n dimensional cones, neural networks, neural nets, upper bounding, polyhedron, logarithm, classification problems, quotient |
19 | Antoni Ferré, Joan Figueras |
On estimating bounds of the quiescent current for IDDQ testin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 14th IEEE VLSI Test Symposium (VTS'96), April 28 - May 1, 1996, Princeton, NJ, USA, pp. 106-111, 1996, IEEE Computer Society, 0-8186-7304-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
quiescent current bounds, sensing circuitry design, VLSI, logic testing, integrated circuit testing, ATPG, automatic testing, CMOS integrated circuits, leakage currents, I/sub DDQ/ testing, CMOS ICs, hierarchical approach |
19 | Sing-Ban Tien, Cauligi S. Raghavendra |
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(6), pp. 713-718, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
n-dimensional hypercube, parallel algorithms, computational complexity, complexity, fault tolerant computing, shortest paths, hypercube networks, diameter, bounds, faulty hypercubes |
19 | Robert E. Felderman, Leonard Kleinrock |
Bounds and Approximations for Self-Initiating Distributed Simulation Without Lookahead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 1(4), pp. 386-406, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Global Virtual Time, optimal, performance analysis, parallel processing, distributed processing, discrete-event simulation, speedup, Time Warp, bounds, virtual time, optimistic simulation |
19 | Neil C. Rowe |
Absolute Bounds on Set Intersection and Union Sizes from Distribution Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(7), pp. 1033-1048, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
union sizes, distribution information, closed-form bounds, rule-based system architecture, statistical analysis, statistical analysis, database theory, set theory, set theory, Boolean algebra, Boolean algebra, file organisation, file organisation, set intersection, database access |
19 | Charles Allan Hall |
Error bounds for periodic quintic splines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 12(8), pp. 450-452, 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
interpolation, spline, error bounds |
19 | Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat |
Coding on Countably Infinite Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(1), pp. 358-373, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Kenneth L. Clarkson, David P. Woodruff |
Numerical linear algebra in the streaming model. ![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. 205-214, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
linear regression, low-rank approximation, matrix product |
19 | N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer |
On the Fingerprinting Capacity Under the Marking Assumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(6), pp. 2678-2689, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone |
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 112(2), pp. 371-401, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Daniele Micciancio, Scott Yilek |
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 535-552, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Xiaoming Sun 0001, David P. Woodruff |
The communication and streaming complexity of computing the longest common and increasing subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 336-345, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
19 | Alexander A. Sherstov |
Separating AC0 from depth-2 majority circuits. ![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. 294-301, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
AC0, communication complexity, discrepancy, threshold circuits |
19 | Igor Gashkov |
Constant Weight Codes with Package CodingTheory.m in Mathematica. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part IV, pp. 370-375, 2004, Springer, 3-540-22129-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Martin C. Rinard, Cristian Cadar, Daniel Dumitran, Daniel M. Roy 0001, Tudor Leu |
A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSAC ![In: 20th Annual Computer Security Applications Conference (ACSAC 2004), 6-10 December 2004, Tucson, AZ, USA, pp. 82-90, 2004, IEEE Computer Society, 0-7695-2252-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Amir Shpilka |
Affine Projections of Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 160-171, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Eunice E. Santos |
Optimal Parallel Algorithms for Solving Tridiagonal Linear Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 700-709, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Ching-Chih Han, Hung-Ying Tyan |
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS '97), December 3-5, 1997, San Francisco, CA, USA, pp. 36-45, 1997, IEEE Computer Society, 0-8186-8268-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
polynomial-time schedulability test, real-time fixed-priority scheduling algorithms, closed-form utilization, polynomial-time schedulability, processor scheduling, schedulability condition |
19 | Juraj Hromkovic |
A New Approach to Defining the Complexity for VLSI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 431-439, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas |
Online Search with Time-Varying Price Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(4), pp. 619-642, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Game theory, Online algorithms, Competitive analysis, Search algorithms |
19 | Toniann Pitassi, Nathan Segerlind |
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 355-364, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | David Niedzielski, Jeffery von Ronne, Andreas Gampe, Kleanthis Psarris |
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 16th International Symposium, SAS 2009, Los Angeles, CA, USA, August 9-11, 2009. Proceedings, pp. 137-153, 2009, Springer, 978-3-642-03236-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Jesús Gómez-Vilardebó, Ana I. Pérez-Neira |
Bounds on Maximum Rate-Per-Energy for Orthogonal AWGN Multiple-Relay Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 7(11-1), pp. 4238-4247, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Cong Ling 0001, Kwok H. Li, Alex ChiChung Kot |
Performance of Space-Time Codes: Gallager Bounds and Weight Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(8), pp. 3592-3610, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba |
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(6), pp. 2566-2571, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Cem Güneri, Ferruh Özbudak |
Weil-Serre Type Bounds for Cyclic Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(12), pp. 5381-5395, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Immanuel M. Bomze, Marco Locatelli 0001, Fabio Tardella |
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(1), pp. 31-64, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C20, 90C26 |
19 | Roni Mittelman, Eric L. Miller 0001 |
Nonlinear Filtering Using a New Proposal Distribution and the Improved Fast Gauss Transform With Tighter Performance Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(12), pp. 5746-5757, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Yonina C. Eldar |
MSE Bounds With Affine Bias Dominating the CramÉr-Rao Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(8-2), pp. 3824-3836, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Chintha Tellambura |
Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 56(8), pp. 1241-1248, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Sumohana S. Channappayya, Alan C. Bovik, Robert W. Heath Jr. |
Rate Bounds on SSIM Index of Quantized Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 17(9), pp. 1624-1639, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Andreas Frommer, Valeria Simoncini |
Error Bounds for Lanczos Approximations of Rational Functions of Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numerical Validation in Current Hardware Architectures ![In: Numerical Validation in Current Hardware Architectures, International Dagstuhl Seminar, Dagstuhl Castle, Germany, January 6-11, 2008. Revised Papers, pp. 203-216, 2008, Springer, 978-3-642-01590-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Zoya Svitkina, Lisa Fleischer |
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 697-706, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Jocelyn Aulin, Djordje Jeremic |
Performance Bounds for MLSD Reception of OFDM Signals in Fast Fading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 4626-4633, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Julia Kempe, Oded Regev 0001, Falk Unger, Ronald de Wolf |
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 845-856, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Sumohana S. Channappayya, Alan C. Bovik, Robert W. Heath Jr., Constantine Caramanis |
Rate Bounds on SSIM Index of Quantized Image DCT Coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2008 Data Compression Conference (DCC 2008), 25-27 March 2008, Snowbird, UT, USA, pp. 352-361, 2008, IEEE Computer Society, 978-0-7695-3121-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
SSIM Index, Uniform quantization |
19 | Dwight K. Hutchenson, Daniel L. Noneaker |
Improved Bounds on the Performance of Convolutional Codes over the Correlated Rayleigh-Fading Channel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCNC ![In: WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008 - April 3 2008, Las Vegas, Nevada, USA, Conference Proceedings, pp. 599-604, 2008, IEEE, 978-1-4244-1997-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. ![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. 276-289, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Hang Dinh, Alexander Russell |
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. ![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. 385-401, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Jochen Eisinger |
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 431-445, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Mark A. Iwen, Craig V. Spencer |
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISS ![In: 42nd Annual Conference on Information Sciences and Systems, CISS 2008, Princeton, NJ, USA, 19-21 March 2008, pp. 458-463, 2008, IEEE, 978-1-4244-2246-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | San Ling, Ferruh Özbudak |
Constructions and bounds on linear error-block codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 45(3), pp. 297-316, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
11T71, AMS Classifications 94B05 |
Displaying result #301 - #400 of 29763 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|