|
|
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 |
20 | Daniel Yuh Chao |
Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound. ![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. 460-465, 2009, Springer, 978-3-642-03094-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
iteration bound, Petri nets, Data Flow Graph (DFG), Concurrent Processing |
20 | Rua-Huan Tsaih, Yat-wah Wan |
A Guide for the Upper Bound on the Number of Continuous-Valued Hidden Nodes of a Feed-Forward Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN (1) ![In: Artificial Neural Networks - ICANN 2009, 19th International Conference, Limassol, Cyprus, September 14-17, 2009, Proceedings, Part I, pp. 658-667, 2009, Springer, 978-3-642-04273-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
single-hidden layer feed-forward neural network, parity problem, Bound, preimage, hidden nodes |
20 | Francis Sourd, Safia Kedad-Sidhoum |
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 11(1), pp. 49-58, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
One-machine scheduling, Earliness-tardiness, Branch-and-bound, Lagrangean relaxation |
20 | Jakob Puchinger, Peter J. Stuckey |
Automating branch-and-bound for dynamic programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, San Francisco, California, USA, January 7-8, 2008, pp. 81-89, 2008, ACM, 978-1-59593-977-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dynamic programming, branch and bound, automatic transformation |
20 | Uk-Pyo Han, Gil-Mo Yang, Jae-Soo Yoo, Young-Jun Chung, Hee-Choon Lee |
A Proposal on the Error Bound of Collaborative Filtering Recommender System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MUE ![In: 2008 International Conference on Multimedia and Ubiquitous Engineering (MUE 2008), 24-26 April 2008, Busan, Korea, pp. 348-354, 2008, IEEE Computer Society, 978-0-7695-3134-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Recommender system, Collaborative filtering, Error bound |
20 | Minmin Shen, Ping Xue 0001, Ci Wang |
The Influence of Regularization Parameter on Error Bound in Super-Resolution Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PCM ![In: Advances in Multimedia Information Processing - PCM 2008, 9th Pacific Rim Conference on Multimedia, Tainan, Taiwan, December 9-13, 2008. Proceedings, pp. 535-542, 2008, Springer, 978-3-540-89795-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
regularization, super-resolution, Error bound |
20 | Xiaoguang Yang, Jianzhong Zhang 0001 |
Some inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(2), pp. 123-135, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Inverse min-max network problem, Weighted l 1 norm, Weighted l? norm, Bound constraints, Polynomial time algorithms |
20 | Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi |
A Grid-based Parallel Approach of the Multi-Objective Branch and Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2007), 7-9 February 2007, Naples, Italy, pp. 23-30, 2007, IEEE Computer Society, 0-7695-2784-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Grid Computing, Multi-Objective Optimization, Branch and Bound |
20 | David Lefranc, Philippe Painchault, Valérie Rouat, Emmanuel Mayer |
A Generic Method to Design Modes of Operation Beyond the Birthday Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 14th International Workshop, SAC 2007, Ottawa, Canada, August 16-17, 2007, Revised Selected Papers, pp. 328-343, 2007, Springer, 978-3-540-77359-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
PRP, PRF, birthday bound, CENC, modes of operation, symmetric encryption, counter mode |
20 | Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede |
Iteration Bound Analysis and Throughput Optimum Architecture of SHA-256 (384, 512) for Hardware Implementations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISA ![In: Information Security Applications, 8th International Workshop, WISA 2007, Jeju Island, Korea, August 27-29, 2007, Revised Selected Papers, pp. 102-114, 2007, Springer, 978-3-540-77534-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
SHA-256 (384,512), Iteration Bound Analysis, Throughput Optimum Architecture |
20 | Mustafa M. Tikir, Laura Carrington, Erich Strohmaier, Allan Snavely |
A genetic algorithms approach to modeling the performance of memory-bound computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings of the ACM/IEEE Conference on High Performance Networking and Computing, SC 2007, November 10-16, 2007, Reno, Nevada, USA, pp. 47, 2007, ACM Press, 978-1-59593-764-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cache bandwidth, memory bound applications, genetic algorithms, machine learning, performance modeling and prediction |
20 | Mathias Péron, Nicolas Halbwachs |
An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings, pp. 268-282, 2007, Springer, 978-3-540-69735-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
difference-bound matrices, disequalities, static analysis, alias analysis, abstract domains |
20 | Zdenek Dostál |
An Optimal Algorithm for Bound and Equality Constrained Quadratic Programming Problems with Bounded Spectrum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 78(4), pp. 311-328, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bound and equality constraints, optimal algorithms, Quadratic programming, augmented Lagrangians |
20 | João Fradinho Oliveira, Bernard F. Buxton |
PNORMS: platonic derived normals for error bound compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRST ![In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology, VRST 2006, Limassol, Cyprus, November 1-3, 2006, pp. 324-333, 2006, ACM, 1-59593-321-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
colour compression, normal compression, run-time encoding, error bound |
20 | Zhaohui Fu, Sharad Malik |
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search. ![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. 852-859, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
MinCostSAT, optimization, branch-and-bound, Boolean satisfiability |
20 | E. J. Cheon, Takao Kato, Seon Jeong Kim |
Nonexistence of [n, 5, d]q Codes Attaining the Griesmer Bound for q4-2q2-2q+1 <= d <= q4-2q2-q. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 36(3), pp. 289-299, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
projective code, linear code, projective space, Griesmer bound |
20 | Jeff T. Linderoth |
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 103(2), pp. 251-282, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Nonconvex quadratic programming, Global optimization, Branch-and-bound, Convex envelope |
20 | H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove |
Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(2), pp. 161-177, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
set-up time, scheduling, branch and bound, families, batches, single machine |
20 | Roberto Andreani, Ana Friedlander |
Bound Constrained Smooth Optimization for Solving Variational Inequalities and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 116(1-4), pp. 179-198, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
bound constrained optimization, variational inequalities, merit functions |
20 | Larry J. Stockmeyer, Albert R. Meyer |
Cosmological lower bound on the circuit complexity of a small problem in logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(6), pp. 753-784, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
WS1S, practical undecidability, computational complexity, lower bound, logic, Circuit complexity, decision problem |
20 | Guo-Hui Lin, Dong Xu 0002, Zhi-Zhong Chen, Tao Jiang 0001, Jianjun Wen, Ying Xu 0001 |
An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 1st IEEE Computer Society Bioinformatics Conference, CSB 2002, Stanford, CA, USA, August 14-16, 2002, pp. 165-174, 2002, IEEE Computer Society, 0-7695-1653-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
chemical shift, peak assignment, combinatorial technique, branch-and-bound, greedy algorithm, protein structure, bipartite matching, NMR |
20 | Peter R. Cappello, Ömer Egecioglu |
Automatic Processor Lower Bound Formulas for Array Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 2002, May 22-24, 2002, Makati City, Metro Manila, Philippines, pp. 59-64, 2002, IEEE Computer Society, 0-7695-1579-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Array computation, Diophantine system, lower bound |
20 | Christophe Genolini, Sébastien Tixeuil |
A Lower Bound on Dynamic k-Stabilization in Asynchronous Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), 13-16 October 2002, Osaka, Japan, pp. 212-, 2002, IEEE Computer Society, 0-7695-1659-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Dynamic problems, Lower bound, Self-stabilization, Asynchronous systems, Transient failures, Time adaptivity |
20 | Micha Sharir, Emo Welzl |
Balanced lines, halving triangles, and the generalized lower bound theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001, pp. 315-318, 2001, ACM, 1-58113-357-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
$k$-sets, Gale transform, Lovasz Lemma, balanced lines, generalized lower bound theorem, halving triangles |
20 | Myung K. Yang, Chita R. Das |
A Parallel Optimal Branch-and-Bound Algorithm for MIN-Based Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the International Conference on Parallel Processing 1999, ICPP 1999, Wakamatsu, Japan, September 21-24, 1999, pp. 112-119, 1999, IEEE Computer Society, 0-7695-0350-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
MIN-based multiprocessor systems, Simulation, Analysis, Computation time, Branch-and-Bound algorithm, Communication time |
20 | Yinan N. Shen, Xiao-Tao Chen, Susumu Horiguchi, Fabrizio Lombardi |
On the multiple fault diagnosis of multistage interconnection networks: the lower bound and the CMOS fault model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 1997 International Conference on Parallel Processing (ICPP '97), August 11-15, 1997, Bloomington, IL, USA, Proceedings, pp. 350-359, 1997, IEEE Computer Society, 0-8186-8108-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
CMOS fault model, multiple fault diagnosis, interconnection networks, fault diagnosis, lower bound, multistage interconnection networks, multistage interconnection networks, CMOS technology, stuck-open faults |
20 | Christer Berg, Staffan Ulfberg |
A Lower Bound for Perceptrons and an Oracle Separation of the PPPH Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 165-172, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
oracle separation, PP/sup PH/ hierarchy, linear size boolean circuits, superpolynomial size perceptrons, lower bound, Boolean functions, perceptrons |
20 | Kanad Ghose, Kiran Raghavendra Desai, Peter M. Kogge |
Using Method Lookup Caches and Register Windowing to Speed Up Dynamically-Bound Object-Oriented Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 22rd EUROMICRO Conference '96, Beyond 2000: Hardware and Software Design Strategies, September 2-5, 1996, Prague, Czech Republic, pp. 441-, 1996, IEEE Computer Society, 0-8186-7487-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
method lookup caches, dynamically-bound object-oriented applications, logical reference, method binding, context allocation, contemporary pipelined datapath, detailed register level simulation, object-oriented programming, object oriented programming languages, register windowing |
20 | Gintaras Palubeckis |
A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 54(4), pp. 283-302, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Integer quadratic programming, graphs, branch and bound |
20 | Myung K. Yang, Chita R. Das |
Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(1), pp. 74-86, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
parallel branch-and-bound algorithm, MIN-based multiprocessorsystems, serial best-first search, conflict-free mapping scheme, performance evaluation, parallel algorithms, multiprocessor interconnection networks, multiprocessing systems, probabilistic model, communication overheads, computation overheads |
20 | Byeungwoo Jeon, David A. Landgrebe |
Fast Parzen Density Estimation Using Clustering-Based Branch and Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(9), pp. 950-954, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
fast Parzen density estimation, clustering-based branch and bound, nonparametric discriminant analysis, multivariant case, data reduction technique, pattern recognition, estimation theory, kernel functions, nonparametric statistics, computational load, data samples |
20 | F. Körner |
An efficient branch and bound algorithm to solve the quadratic integer programming problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 30(3), pp. 253-260, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
Integer quadratic programming, branch and bound |
19 | Matei David, Periklis A. Papakonstantinou |
Trade-Off Lower Bounds for Stack Machines. ![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. 163-171, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
AuxPDA, lower bound, streaming, communication complexity, stack, reversals, space bound |
19 | Hyunwoo Jung, Kyung-Yong Chwa |
The Balloon Popping Problem Revisited: Lower and Upper Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings, pp. 147-158, 2009, Springer, 978-3-642-04644-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
lower bound, auction, upper bound |
19 | Karl Schnaitter, Neoklis Polyzotis |
Evaluating rank joins with optimal cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada, pp. 43-52, 2008, ACM, 978-1-60558-108-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
feasible-region bound, pbrj, rank join, ranking query optimization, tight bound |
19 | Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap |
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings, pp. 87-94, 2008, ACM, 978-1-59593-904-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
complete numerical algorithm, evaluation bound, implicit algebraic curve, root bound, meshing, singularity, subdivision algorithm |
19 | Hoang Tuy |
On a decomposition method for nonconvex global optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 1(3), pp. 245-258, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Nonconvex global optimization, Partly convex, Partly monotonic, Monotonic/linear problems, Branch and bound decomposition algorithm, Lagrangian bound, Convergence conditions, Parametric optimization, Duality gap |
19 | Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap |
Complete numerical isolation of real zeros in zero-dimensional triangular systems. ![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. 92-99, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
evaluation bound, real zero isolation, sleeve bound, triangular system |
19 | Liang-Liang Xie, Panganamala R. Kumar |
On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2313-2328, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
capacity of wireless networks, cut-set bound, max-flow min-cut bound, multiuser information theory, ad hoc networks, wireless networks, scaling laws, transport capacity, network information theory |
19 | Henrik Lipskoch, Karsten Albers, Frank Slomka |
Battery discharge aware energy feasibility analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES+ISSS ![In: Proceedings of the 4th International Conference on Hardware/Software Codesign and System Synthesis, CODES+ISSS 2006, Seoul, Korea, October 22-25, 2006, pp. 22-27, 2006, ACM, 1-59593-370-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
demand bound function, energy bound function, power consumption, spice, battery modeling, event stream |
19 | K. H. (Kane) Kim |
Timeliness Assurance via Hybrid Approaches during Design of Distributed Embedded Computing Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WORDS Fall ![In: 9th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS Fall 2003), 1-3 October 2003, Anacapri (Capri Island), Italy, pp. 307-, 2003, IEEE Computer Society, 0-7695-2054-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
service time bound, statistical derivation, analytical derivation, soft-firm bound, real time, certification, object, TMO, embedded computing, timeliness, hybrid approach, guarantee |
19 | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter |
Fast Broadcasting and Gossiping in Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 575-581, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
radio broadcasting, fast broadcasting algorithm, deterministic distributed broadcasting, lower bound, network topology, network topology, time complexity, communication complexity, upper bound, gossiping, deterministic algorithms, radio networks, multi-hop radio networks |
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 | Lars Arge, Jeffrey Scott Vitter |
Optimal Dynamic Interval Management in External Memory (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 560-569, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
optimal dynamic interval management, space-optimal external-memory data structure, I/O-optimal external-memory data structure, stabbing query answering, dynamically maintained intervals, I/O algorithms, 2D range searching, optimal linear space, optimal I/O query bound, optimal I/O update bound, worst-case update bounds, balancing technique, worst-case balanced tree manipulation, databases, object-oriented databases, temporal databases, storage management, constraint logic programming, external memory |
19 | Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan 0001 |
Linearity Testing in Characteristic Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 432-441, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
characteristic two, relative distance, rejection probability, Max3SAT, MaxSNP problems, lower bounds, lower bound, probability, theorem proving, upper bound, homomorphisms, Fourier analysis, Fourier analysis, linearity testing, linear functions |
19 | Noam Nisan, Steven Rudich, Michael E. Saks |
Products and Help Bits in Decision Trees ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 318-329, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
help bits, k-tuple, parallel decision tree algorithms, fixed depth bound, maximum fraction, arbitrary binary questions, complexity, lower bound, decision trees, multivariate polynomial |
19 | Bernard Chazelle |
A Spectral Approach to Lower Bounds ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 674-682, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
median eigenvalue, nonlinear lower bound, halfplane range searching, nontrivial lower bound, linear circuit complexity, linear map, geometric set system, lower bounds, range searching |
19 | Greg Barnes, Jeff Edmonds |
Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 228-237, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
directed s-t connectivity, JAG models, s-t connectivity, distinguished vertex, time-space lower bound, directed graph, upper bound |
19 | Lavinia Egidi |
The Complexity of the Theory of p-adic Numbers ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 412-421, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
elementary upper bound, p-adic numbers, double exponential alternating time, double exponential space, cell decomposition, complexity, lower bound, decision problem, semi-algebraic sets |
19 | Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam 0001 |
Directed vs. Undirected Monotone Contact Networks for Threshold Functions ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 604-613, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Boolean functions complexity, monotone contact networks, almost optimal, lower bound, upper bound, threshold functions |
19 | Mohammed Atiquzzaman, W. H. Shehadah |
A Microprocessor-Based Office Image Processing System-An Extension of Work. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(3), pp. 379-384, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
microprocessor-based office image processing system, compute-bound, I/O-bound state, image input time, computerised picture processing |
19 | Peter Bro Miltersen, Mike Paterson, Jun Tarui |
The Asymptotic Complexity of Merging Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 236-246, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
merging networks, monotone Boolean circuits, lower bound, permutations, upper bound, switching networks, comparators, comparator network, asymptotic complexity |
19 | Amotz Bar-Noy, David Peleg |
Square Meshes are not always Optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(2), pp. 196-204, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
broadcast facilities, rows, columns, two-dimensional rectangular mesh, skewed rectangular mesh, parallel architectures, upper bound, tight bound, mesh connected computers, semigroup computations, multiple buses |
19 | Anja Feldmann, Jirí Sgall, Shang-Hua Teng |
Dynamic Scheduling on Parallel Machines ![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. 111-120, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
fixed-dimensional meshes, online job scheduling, lower bound proof, parallel architectures, parallel machines, upper bound, dynamic scheduling |
19 | Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa |
Time-Space Tradeoffs for Undirected Graph Traversal ![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. 429-438, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
jumping automata, undirected graph traversal, quadratic lower bound, probabilistic upper bound, time-space tradeoff, deterministic model |
19 | Wolfgang Maass 0001, György Turán |
On the Complexity of Learning From Counterexamples (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. 262-267, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
combinatorial invariants, complexity of learning, d-dimensional discrete space, lower bound, upper bound, finite domain |
19 | Hisao Kameda |
Optimality of a Central Processor Scheduling Policy for Processing a Job Stream ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 2(1), pp. 78-90, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
1/0 bound, CPU bound, Markovian queuing model, dispatching policy, finite-source queue, job stream, machine repairman model, multiple-resource system, near-complete decomposability, multiprogramming, CPU scheduling, preemptive priority |
19 | Benjamin W. Wah, Y. W. Eva Ma |
MANIP - A Multicomputer Architecture for Solving Combinatorial Extremum-Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 33(5), pp. 377-390, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
Approximate branch-and-bound, parallel branch-and-bound, vertex-covering problem, selection, virtual memory, NP-hard problems, ring network |
19 | Marc Glisse, Sylvain Lazard |
On the complexity of sets of free lines and line segments among balls in three dimensions. ![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. 48-57, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
3D visibility, free lines, free segments, visibility complex, balls |
19 | Guowen Han, Yuanyuan Yang 0001 |
Scheduling and performance analysis of multicast interconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 40(2), pp. 109-125, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Quality-of-service (QoS), Approximation algorithms, Multicast, Interconnects, Scheduling algorithms, Random graph, Conflict graph |
19 | Monique Laurent |
Strengthened semidefinite programming bounds for codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 109(2-3), pp. 239-261, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C27, 90C22, 94B65, 05E20 |
19 | Qi Wu 0002, Yongqiang Xiong, Qian Zhang 0001, Zihua Guo, Xiang-Gen Xia 0001, Zhongcheng Li |
Joint routing and topology formation in multihop UWB networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 24(4), pp. 843-849, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Vignesh Sethuraman, Bruce E. Hajek |
Comments on "Bit-interleaved coded modulation". ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(4), pp. 1795-1797, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Andris Ambainis, Daniel Gottesman |
The minimum distance problem for two-way entanglement purification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(2), pp. 748-753, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Gudmund Skovbjerg Frandsen, Peter Frands Frandsen |
Dynamic Matrix Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 395-406, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis |
The Impact of Network Structure on the Stability of Greedy Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(4), pp. 425-460, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Boris Aronov, Vladlen Koltun, Micha Sharir |
Incidences between points and circles in three and higher dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 116-122, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
three dimensions, combinatorial geometry, incidences, circles |
19 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
Selective families, superimposed codes, and broadcasting on unknown radio networks. ![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. 709-718, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
19 | Parampalli Udaya, Serdar Boztas |
On the Aperiodic Correlation Function of Galois Ring m-Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings, pp. 229-238, 2001, Springer, 3-540-42911-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Quadriphase sequences, Aperiodic correlations, Gauss sums over Galois rings, Galois Rings |
19 | Markus Bläser |
Computing Reciprocals of Bivariate Power Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 186-197, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Liam Keliher, Henk Meijer, Stafford E. Tavares |
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding, pp. 420-436, 2001, Springer, 3-540-42070-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
substitution-permutation networks, maximum average linear hull probability, provable security, linear cryptanalysis |
19 | Jürgen Forster, Matthias Krause 0001, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon |
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings, pp. 171-182, 2001, Springer, 3-540-43002-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Marina V. Kondratieva, Alexander V. Mikhalev, E. V. Pankratiév |
Jacobi's bound for independent systems of algebraic partial differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 20(1), pp. 65-71, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 12H05 |
18 | Yang Cai 0001, Ting Zhang, Haifeng Luo |
An Improved Lower Bound for the Complementation of Rabin Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 167-176, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Colcombet, Konrad Zdanowski |
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 151-162, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Lei Jia, Shizhong Liao |
Accurate Probabilistic Error Bound for Eigenvalues of Kernel Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACML ![In: Advances in Machine Learning, First Asian Conference on Machine Learning, ACML 2009, Nanjing, China, November 2-4, 2009. Proceedings, pp. 162-175, 2009, Springer, 978-3-642-05223-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi, Mohammed J. Zaki |
Clustering with Lower Bound on Similarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 13th Pacific-Asia Conference, PAKDD 2009, Bangkok, Thailand, April 27-30, 2009, Proceedings, pp. 122-133, 2009, Springer, 978-3-642-01306-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Daniel Enrique Lucani, Muriel Médard, Milica Stojanovic |
Underwater Acoustic Networks: Channel Models and Network Coding Based Lower Bound to Transmission Power for Multicast. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 26(9), pp. 1708-1719, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Maja Loncar |
An Improved Bound on the List Error Probability and List Distance Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(1), pp. 13-32, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Christian Blum 0001, Carlos Cotta, Antonio J. Fernández 0001, José E. Gallardo, Monaldo Mastrolilli |
Hybridizations of Metaheuristics With Branch & Bound Derivates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, An Emerging Approach to Optimization, pp. 85-116, 2008, Springer, 978-3-540-78294-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir |
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2008 Data Compression Conference (DCC 2008), 25-27 March 2008, Snowbird, UT, USA, pp. 489-498, 2008, IEEE Computer Society, 978-0-7695-3121-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Complexity, Delay, Redundancy, Source coding, Precision, Arithmetic coding |
18 | Martin Paluszewski, Pawel Winter |
Protein Decoy Generation Using Branch and Bound with Efficient Bounding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings, pp. 382-393, 2008, Springer, 978-3-540-87360-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Aaron B. Wagner |
An outer bound for distributed compression of linear functions. ![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. 435-440, 2008, IEEE, 978-1-4244-2246-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Christian Schellewald |
A Bound for Non-subgraph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings, pp. 71-80, 2007, Springer, 978-3-540-72902-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Adam R. Klivans, Alexander A. Sherstov |
A Lower Bound for Agnostically Learning Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings, pp. 409-423, 2007, Springer, 978-3-540-72925-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Pramod Lakshmi Narasimha, Michael T. Manry, Francisco Maldonado |
Upper Bound on Pattern Storage in Feedforward Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2007, Celebrating 20 years of neural networks, Orlando, Florida, USA, August 12-17, 2007, pp. 1714-1719, 2007, IEEE, 978-1-4244-1379-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Cédric Pessan, Jean-Louis Bouquard, Emmanuel Néron |
Genetic Branch-and-Bound or Exact Genetic Algorithm?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artificial Evolution ![In: Artificial Evolution, 8th International Conference, Evolution Artificielle, EA 2007, Tours, France, October 29-31, 2007, Revised Selected Papers, pp. 136-147, 2007, Springer, 978-3-540-79304-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Theo G. Swart, Hendrik C. Ferreira |
A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3685-3695, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Yahya Z. Mohasseb, Michael P. Fitz, Urbashi Mitra |
An improved bound on the performance of maximum-likelihood multiuser detection receivers in Rayleigh fading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(3), pp. 1184-1196, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Svantesson, A. Lee Swindlehurst |
A performance bound for prediction of MIMO channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 54(2), pp. 520-529, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Songtao Guo, Xintao Wu, Yingjiu Li |
On the Lower Bound of Reconstruction Error for Spectral Filtering Based Privacy Preserving Data Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings, pp. 520-527, 2006, Springer, 3-540-45374-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Alexis Maciel, Toniann Pitassi |
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pp. 189-200, 2006, IEEE Computer Society, 0-7695-2631-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Alexander A. Razborov, Sergey Yekhanin |
An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. ![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. 739-748, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Uli Wagner 0001 |
On a Geometric Generalization of the Upper Bound Theorem. ![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. 635-645, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Krzysztof Pietrzak |
A Tight Bound for EMAC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 168-179, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Fuye Feng, Yong Xia, Quanju Zhang |
A Recurrent Neural Network for Linear Fractional Programming with Bound Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2006, Third International Symposium on Neural Networks, Chengdu, China, May 28 - June 1, 2006, Proceedings, Part I, pp. 359-368, 2006, Springer, 3-540-34439-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Beate Bollig, Philipp Woelfel |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(6), pp. 671-685, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Jun Saiki, Hirofumi Miyatsuji |
Limitation of Maintenance of Feature-Bound Objects in Visual Working Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BVAI ![In: Brain, Vision, and Artificial Intelligence, First International Symposium, BVAI 2005, Naples, Italy, October 19-21, 2005, Proceedings, pp. 215-224, 2005, Springer, 3-540-29282-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Petr Somol, Pavel Pudil, Josef Kittler |
Fast Branch & Bound Algorithms for Optimal Feature Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(7), pp. 900-912, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Beate Bollig, Philipp Woelfel |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 131-142, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 24719 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|