|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14493 occurrences of 5604 keywords
|
|
|
Results
Found 24722 publication records. Showing 24719 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
23 | E. Betti, Massimiliano Sala |
A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3700-3706, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Kenneth E. Hild II, Deniz Erdogmus, José Carlos Príncipe |
Experimental upper bound for the performance of convolutive source separation methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 54(2), pp. 627-635, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Jinjun Chen, Yun Yang 0001 |
Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SKG ![In: 2006 International Conference on Semantics, Knowledge and Grid (SKG 2006), 1-3 November 2006, Guilin, China, pp. 10, 2006, IEEE Computer Society, 0-7695-2673-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Paul Horton, Wataru Fujibuchi |
An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, pp. 219-228, 2005, Springer, 3-540-26201-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Peter Auer, Ronald Ortner |
A New PAC Bound for Intersection-Closed Concept Classes. ![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. 408-414, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Rahul Jain 0001, Jaikumar Radhakrishnan, Pranab Sen |
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 220-229, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Hachemi Bennaceur, Aomar Osmani |
Computing Lower Bound for MAX-CSP Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Developments in Applied Artificial Intelligence, 16th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2003, Laughborough, UK, June 23-26, 2003, Proceedings, pp. 614-624, 2003, Springer, 3-540-40455-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Károly Bezdek |
Improving Rogers' Upper Bound for the Density of Unit Ball Packings via Estimating the Surface Area of Voronoi Cells from Below in Euclidean d-Space for All d>=8. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 28(1), pp. 75-106, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Tarek F. Abdelzaher, Björn Andersson, Jan Jonsson, Vivek Sharma 0004, Minh Nguyen |
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Real Time Technology and Applications Symposium ![In: Proceedings of the 8th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2002), 24-27 September 2002, San Jose, CA, USA, pp. 173-184, 2002, IEEE Computer Society, 0-7695-1739-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks |
23 | Harry Dwyer, John Fernando |
Establishing a tight bound on task interference in embedded system instruction caches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2001 International Conference on Compilers, Architectures and Synthesis for Embedded Systems, CASES 2001, Atlanta, Georgia, USA, November 16-17, 2001, pp. 8-14, 2001, ACM, 1-58113-399-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Mayez A. Al-Mouhamed |
Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(12), pp. 1390-1401, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
precedence graphs, earliest starting time, task delay, finish time, minimum time increase, interprocessor communication links, optimum performance, small graphs, scheduling, scheduling, graph theory, lower bounds, communication costs, task graph, completion time, time interval |
23 | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven |
On the Black-Box Complexity of Sperner's Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(3), pp. 629-646, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Sperner’s lemma, Probabilistic and quantum lower bound, Deterministic algorithm, Query complexity |
23 | Adam Panagos, Kurt L. Kosbar |
A new design metric for unitary space-time codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2006, Vancouver, British Columbia, Canada, July 3-6, 2006, pp. 671-676, 2006, ACM, 1-59593-306-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
union bound design metric, unitary space-time code, MIMO |
23 | Myungsook Klassen, Russell Stockard, Ali Akbari |
Stimulating information technology education among underrepresented minorities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGITE Conference ![In: Proceedings of the 5th Conference on Information Technology Education, SIGITE 2004, 2004, Salt Lake City, UT, USA, October 28-30, 2004, pp. 278, 2004, ACM, 1-58113-936-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
computer science college major, computer science pipeline, status attainment model, underrepresented minorities, upward bound program, information technology, self-efficacy, social cognition theory |
23 | Satoshi Fujita, Tadanori Nakagawa |
Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques, Newport Beach, California, USA, October 12-16, 1999, pp. 212-220, 1999, IEEE Computer Society, 0-7695-0425-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
inevitable communication delay, lower bound, Multiprocessor scheduling problem |
23 | 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 |
22 | Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt |
A Separation Bound for Real Algebraic Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 14-28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Separation bound, Zero testing, Exact geometric computation |
22 | Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson |
A branch, bound, and remember algorithm for the 1| r i | Sigma t i scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(2), pp. 163-175, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling theory and algorithms, Dynamic programming, Branch and bound algorithms |
22 | Justin Yip, Pascal Van Hentenryck |
Length-lex bound consistency for knapsack constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009, pp. 1397-1401, 2009, ACM, 978-1-60558-166-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
length-lex, set variable, knapsack, bound consistency |
22 | Christian Artigues, Dominique Feillet |
A branch and bound method for the job-shop problem with sequence-dependent setup times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 135-159, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Dynamic programming, Branch and bound, Constraint propagation, Job-shop scheduling, Sequence-dependent setup times |
22 | UmaMaheswari C. Devi, James H. Anderson |
A schedulable utilization bound for the multiprocessor EPDF\mathsf{EPDF} Pfair algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 38(3), pp. 237-288, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multiprocessors, Real-time scheduling, Utilization bound, Pfair |
22 | Samuel Burer, Dieter Vandenbussche |
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 113(2), pp. 259-282, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Nonconcave quadratic maximization, Nonconvex quadratic programming, Lift-and-project relaxations, Branch-and-bound, Semidefinite programming |
22 | Tetsu Iwata |
Authenticated Encryption Mode for Beyond the Birthday Bound Security. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AFRICACRYPT ![In: Progress in Cryptology - AFRICACRYPT 2008, First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008. Proceedings, pp. 125-142, 2008, Springer, 978-3-540-68159-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
birthday bound, modes of operation, authenticated encryption, security proofs, Blockcipher |
22 | Torsten Fahle, Karsten Tiemann |
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 11, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem |
22 | Irit Katriel, Sven Thiel |
Complete Bound Consistency for the Global Cardinality Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 10(3), pp. 191-217, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
global cardinality constraint, matching, graph algorithms, flow, constraint propagation, global constraints, arc consistency, filtering algorithms, bound consistency |
22 | Vincent T'kindt, Federico Della Croce, Carl Esswein |
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(6), pp. 429-440, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
search tree strategies, dominance properties, branch and bound |
22 | Zhenxiao Wang, Jie Yang 0002, Guozheng Li 0001 |
An Improved Branch & Bound Algorithm in Feature Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC ![In: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 9th International Conference, RSFDGrC 2003, Chongqing, China, May 26-29, 2003, Proceedings, pp. 549-556, 2003, Springer, 3-540-14040-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Minimum Solution Tree, Global Optimum, Data Mining, Machine Learning, Pattern Recognition, Feature Selection, Branch & Bound |
22 | Isabel Dorta, Coromoto León, Casiano Rodríguez |
A Comparison between MPI and OpenMP Branch-and-Bound Skeletons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 131, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
MPI, Skeletons, Branch and Bound, OpenMP |
22 | Jürgen Garloff, Andrew P. Smith 0001 |
A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOS ![In: Global Optimization and Constraint Satisfaction, Second International Workshop, COCOS 2003, Lausanne, Switzerland, November 18-21, 2003, Revised Selected Papers, pp. 71-85, 2003, Springer, 3-540-26003-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
complexity, global optimization, convex hull, control points, Bernstein polynomials, bound functions |
22 | Ranganath Nuggehalli, Timothy J. Lowe, James E. Ward |
An Improved Lower Bound for the Multimedian Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 110(1-4), pp. 17-31, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
location on networks, median problem, lower bound |
22 | 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 |
22 | N. R. Achuthan, A. Hardjawidjaja |
Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 108(1-4), pp. 55-74, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
project compression, branch and bound, project scheduling |
22 | Sofia Eklund, Kalevi Pessi |
Exploring Mobile eCommerce in Graphical Bound Retailing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 34th Annual Hawaii International Conference on System Sciences (HICSS-34), January 3-6, 2001, Maui, Hawaii, USA, 2001, IEEE Computer Society, 0-7695-0981-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
geographical bound services, mobility, recommender systems, electronic commerce |
22 | Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra |
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 27(1), pp. 87-99, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Separation bound, Exact geometric computation |
22 | R. Neil Braithwaite, Bir Bhanu |
Error bound for multi-stage synthesis of narrow bandwidth Gabor filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 33-36, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
narrow bandwidth Gabor filters, multistage synthesis, weighted sum, spatially offset separable kernels, frequency offset, spatial subsampling rate, multistage filtering, general basis filter set design, error analysis, filtering theory, error bound, network synthesis |
22 | Wael A. Hashlamoun, Pramod K. Varshney, V. N. S. Samarasooriya |
A Tight Upper Bound on the Bayesian Probability of Error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(2), pp. 220-224, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
tight upper bound, Bayesian probability, minimum error probability, pattern recognition, probability, decision theory, Bayes methods, statistical pattern recognition |
22 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
A Lower Bound for Integer Greatest Common Divisor Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(2), pp. 453-471, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
floor operation, greatest common devisor, mod operation, lower bound, truncation |
22 | Craig H. Richardson, Ronald W. Schafer |
A Lower Bound for Structuring Element Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(4), pp. 365-369, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
morphological structuring elements, lower bound, picture processing, picture processing, optimisation, decomposition |
22 | Chee Fen Yu, Benjamin W. Wah |
Efficient Branch-and-Bound Algorithms on a Two-Level Memory System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(9), pp. 1342-1356, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
two-level memory system, storage management, virtual-memory, storage allocation, depth-first search, branch-and-bound algorithms, virtual storage, best-first search |
22 | Michael J. Quinn, Narsingh Deo |
An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIT ![In: BIT 26(1), pp. 35-43, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
22 | Hatem M. Bahig |
Improved Generation of Minimal Addition Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 78(2), pp. 161-172, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
nonstar lower bound, sorting, branch and bound algorithm, Addition chain |
22 | Hiroyuki Miyazawa, Thomas Erlebach |
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(4), pp. 293-311, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
interval scheduling, lower bound, randomized algorithm, competitive analysis, upper bound, on-line algorithm |
22 | Dar-Tzen Peng, Kang G. Shin, Tarek F. Abdelzaher |
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 23(12), pp. 745-758, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Branch-and-bound (B&B) algorithm, computation and communication modules, precedence and timing constraints, task invocation and release times, lower-bound cost, intertask communication |
22 | Woohyuk Lee, Abelardo Pardo, Jae-Young Jang, Gary D. Hachtel, Fabio Somenzi |
Tearing based automatic abstraction for CTL model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996, pp. 76-81, 1996, IEEE Computer Society / ACM, 0-8186-7597-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
ACTL model checking, CTL model checking, conservative ECTL, lattice set, lower bound approximations, pseudo-optimal shortest path, resolution methods, tearing based automatic abstraction, upper bound approximations, formal verification, reactive system, bipartition |
22 | William Blume, Rudolf Eigenmann |
Symbolic range propagation. ![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. 357-363, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
symbolic range propagation, arbitrary symbolic expressions, Polaris, zero-trip loops, array sections, loop iteration-count estimation, lower bound, transformations, program test, program compilers, upper bound, parallelizing compiler, symbol manipulation, parallelising compilers |
21 | 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 |
|
21 | Timothy M. Chan |
On levels in arrangements of curves, iii: further improvements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 85-93, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
k-levels, k-sets, arrangements, combinatorial geometry |
21 | Yingbin Liang, Gerhard Kramer |
Rate Regions for Relay Broadcast Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(10), pp. 3517-3535, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Ilia Rapoport, Yaakov Oshman |
Weiss-Weinstein Lower Bounds for Markovian Systems. Part 1: Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(5-2), pp. 2016-2030, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Madhavan Vajapeyam, Jifeng Geng, Urbashi Mitra |
Tools for Performance Analysis and Design of Space-Time Block Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 55(2), pp. 367-379, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Martin B. Haugh, Ashish Jain |
Path-wise estimators and cross-path regressions: an application to evaluating portfolio strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the Winter Simulation Conference, WSC 2007, Washington, DC, USA, December 9-12, 2007, pp. 1013-1020, 2007, WSC, 1-4244-1306-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Nathaniel John King, Neil D. Lawrence |
Fast Variational Inference for Gaussian Process Models Through KL-Correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2006, 17th European Conference on Machine Learning, Berlin, Germany, September 18-22, 2006, Proceedings, pp. 270-281, 2006, Springer, 3-540-45375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Vineet Bafna, Vikas Bansal 0001 |
Improved Recombination Lower Bounds for Haplotype Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings, pp. 569-584, 2005, Springer, 3-540-25866-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Scot Anderson, Peter Z. Revesz |
Verifying the Incorrectness of Programs and Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings, pp. 1-13, 2005, Springer, 3-540-27872-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | José María López, José Luis Díaz, Daniel F. García |
Minimum and Maximum Utilization Bounds for Multiprocessor Rate Monotonic Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 15(7), pp. 642-653, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Hartmut Klauck |
Rectangle Size Bounds and Threshold Covers in Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 118-134, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Kazuhito Ito, Keshab K. Parhi |
Determining the minimum iteration period of an algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 11(3), pp. 229-244, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | John W. Carr III |
Error Bounds for the Runge-Kutta Single-Step Integration Process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 5(1), pp. 39-44, 1958. The full citation details ...](Pics/full.jpeg) |
1958 |
DBLP DOI BibTeX RDF |
|
21 | Aaron B. Wagner, Venkat Anantharam |
An Improved Outer Bound for Multiterminal Source Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(5), pp. 1919-1937, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Eric Chaumette, Jérôme Galy, Angela Quinlan, Pascal Larzabal |
A New Barankin Bound Approximation for the Prediction of the Threshold Region Performance of Maximum Likelihood Estimators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(11), pp. 5319-5333, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Anup Rao 0001 |
Parallel repetition in projection games and a concentration bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 1-10, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
chsh game, parallel repetition, unique games conjecture |
21 | Tianping Shuai, Donglei Du |
A Lower Bound for the On-Line Preemptive Machine Scheduling with lp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 661-669, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | 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 |
21 | Chandra Nair, Abbas El Gamal |
An Outer Bound to the Capacity Region ofthe Broadcast Channel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(1), pp. 350-355, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Alexandre Renaux, Leïla Najjar Atallah, Philippe Forster, Pascal Larzabal |
A Useful Form of the Abel Bound and Its Application to Estimator Threshold Prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(5-2), pp. 2365-2369, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Mi Zhou, Man Hon Wong 0001 |
Boundary-Based Lower-Bound Functions for Dynamic Time Warping and Their Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007, pp. 1307-1311, 2007, IEEE Computer Society, 1-4244-0802-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Jianjia Wu, Jyh-Charn Liu, Wei Zhao 0001 |
Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS 2007), 3-6 December 2007, Tucson, Arizona, USA, pp. 435-446, 2007, IEEE Computer Society, 0-7695-3062-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Ruxin Qin, Jing Chen, Naiyang Deng, Yingjie Tian 0001 |
A Leave-One-Out Bound for nu-Support Vector Regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 669-676, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Xiaoyu Liu |
Weights Modulo a Prime Power in Divisible Codes and a Related Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(10), pp. 4455-4463, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Stephanie Perkins, Alexander L. Sakhnovich, Derek H. Smith |
On an upper bound for mixed error-correcting codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(2), pp. 708-712, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci |
Provably-secure time-bound hierarchical key assignment schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, October 30 - November 3, 2006, pp. 288-297, 2006, ACM. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
access control, provable security, key assignment |
21 | Li-Te Huang, Shan-Tai Chen, Shun-Shii Lin |
Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACG ![In: Advances in Computer Games, 11th International Conference, ACG 2005, Taipei, Taiwan, September 6-9, 2005. Revised Papers, pp. 195-209, 2006, Springer, 3-540-48887-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Yuelin Gao, Chengxian Xu, Jimin Li |
Linear Programming Relax-PSO Hybrid Bound Algorithm for a Class of Nonlinear Integer Programming Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Computational Intelligence and Security, International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers, pp. 29-35, 2006, Springer, 978-3-540-74376-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Ambighairajah Yasotharan |
Lower bound on the BER of a pre- and postequalized vector communication system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 53(3), pp. 453-462, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Jianhua Xu |
Designing Nonlinear Classifiers Through Minimizing VC Dimension Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2005, Second International Symposium on Neural Networks, Chongqing, China, May 30 - June 1, 2005, Proceedings, Part I, pp. 900-905, 2005, Springer, 3-540-25912-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Chu Min Li, Felip Manyà, Jordi Planes |
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 403-414, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Zili Shao, Chun Xue, Qingfeng Zhuge, Edwin Hsing-Mean Sha, Bin Xiao 0001 |
Efficient Array & Pointer Bound Checking Against Buffer Overflow Attacks via Hardware/Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC (1) ![In: International Symposium on Information Technology: Coding and Computing (ITCC 2005), Volume 1, 4-6 April 2005, Las Vegas, Nevada, USA, pp. 780-785, 2005, IEEE Computer Society, 0-7695-2315-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Shahram Yousefi, Amir K. Khandani |
A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 50(12), pp. 3026-3036, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | James H. Anderson, Yong-Jik Kim |
An improved lower bound for the time complexity of mutual exclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 15(4), pp. 221-253, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Lower bounds, Shared memory, Time complexity, Mutual exclusion, Atomicity, Local spinning |
21 | Salil S. Kanhere, Harish Sethu |
On the Latency Bound of Pre-Order Deficit Round Robin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: 27th Annual IEEE Conference on Local Computer Networks (LCN 2002), 6-8 November 2002, Tampa, FL, USA, Proceedings, pp. 508-517, 2002, IEEE Computer Society, 0-7695-1591-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Chen Li 0003, Chee-Keng Yap |
A new constructive root bound for algebraic expressions. ![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. 496-505, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
21 | Liam Keliher, Henk Meijer, Stafford E. Tavares |
Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001, Revised Papers, pp. 112-128, 2001, Springer, 3-540-43066-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Svetla Nikova, Ventzislav Nikov |
Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 8th IMA International Conference, Cirencester, UK, December 17-19, 2001, Proceedings, pp. 191-204, 2001, Springer, 3-540-43026-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Stammermann, Wolfgang Nebel |
Lower Bound Estimation for Low Power High-Level Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSS ![In: Proceedings of the 13th International Symposium on System Synthesis, ISSS'00, Madrid, Spain, September 20-22, 2000., pp. 180-186, 2000, ACM / IEEE Computer Society, 0-7695-0765-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
A Comparison of Two Lower Bound Methods for Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 326-335, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | V. J. de Jong |
Symbolic dimension bound checking in a matrix language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCL ![In: 1988 Internation Conference on Computer Languages, October 9-13, 1988, Miami, Florida, USA, pp. 73-80, 1988, IEEE Computer Society, 0-8186-0874-9. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
21 | Toshihide Ibaraki |
The Power of Dominance Relations in Branch-and-Bound Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 24(2), pp. 264-279, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
20 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Variable Sized Online Interval Coloring with Bandwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 385-401, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Interval coloring, Approximation algorithm, Lower bound, Competitive analysis |
20 | Zaichen Qian, Evangeline F. Y. Young |
Multi-voltage floorplan design with optimal voltage assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2009 International Symposium on Physical Design, ISPD 2009, San Diego, California, USA, March 29 - April 1, 2009, pp. 13-18, 2009, ACM, 978-1-60558-449-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
multi-voltage assignment optimization branch-and-bound |
20 | Tal Mizrahi, Yoram Moses |
Continuous Consensus with Failures and Recoveries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, pp. 408-422, 2008, Springer, 978-3-540-87778-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Continuous Consensus, Early decision, Process recovery, Round-based computation model, Synchronous message-passing system, Distributed algorithm, Lower bound, Modularity, Consensus, Agreement problem, Common Knowledge, Simultaneity, Omission failures, Process crash failure |
20 | Zuosong Liang, Erfang Shan, T. C. Edwin Cheng |
Clique-Transversal Sets in Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 107-115, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Clique-transversal number, Claw-free, Bound, Cubic graph |
20 | Daniel Kunkle, Gene Cooperman |
Twenty-six moves suffice for Rubik's cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 235-242, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Rubik's cube, disk-based methods, fast multiplication, upper bound, permutation groups |
20 | Elad Barkan, Eli Biham, Adi Shamir |
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings, pp. 1-21, 2006, Springer, 3-540-37432-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Time/memory tradeoff, time/memory/data tradeoff, hidden state, stateful random graph, Hellman, lower bound, Cryptanalysis, rigorous, Rainbow |
20 | Arno Eigenwillig, Vikram Sharma 0001, Chee-Keng Yap |
Almost tight recursion tree bounds for the Descartes method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 71-78, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Davenport-Mahler bound, Descartes method, Descartes rule of signs, polynomial real root isolation, Bernstein basis |
20 | 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 |
20 | Chang-Gun Lee, Lui Sha |
Enhanced Processor Budget for QoS Management in Multimedia Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 123, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
QoS, multimedia, resource reservation, fixed-priority scheduling, utilization bound |
20 | Quan T. Nguyen, Saïd Bettayeb |
The upper bound and lower bound of the genus of pancake graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), July 5-8, Sousse, Tunisia, pp. 800-804, 2009, IEEE Computer Society, 978-1-4244-4672-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | George Christodoulou 0001, Elias Koutsoupias, Angelina Vidali |
A Lower Bound for Scheduling Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(4), pp. 729-740, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling unrelated machines, Lower bound, Algorithmic mechanism design |
20 | Antanas Zilinskas, Julius Zilinskas |
Branch and bound algorithm for multidimensional scaling with city-block metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 43(2-3), pp. 357-372, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
City-block metric, Branch and bound, Multidimensional scaling |
20 | Yu-Fang Chung, Tzer-Shyong Chen, Chia-Chao Ho, Yi-Hsuan Yeh, Hsiu-Chia Ko |
Hierarchical Time-Bound Key Management for Mobile Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 9th International Conference, ICA3PP 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings, pp. 242-253, 2009, Springer, 978-3-642-03094-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Time-bound Key Management, Access Control, Mobile Agent, Key Management, Elliptic Curve Cryptosystem |
Displaying result #101 - #200 of 24719 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|