The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase upper bound (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1969 (15) 1970-1973 (17) 1974-1976 (19) 1977-1979 (15) 1980-1981 (15) 1982-1984 (18) 1985 (19) 1986-1987 (28) 1988 (21) 1989 (31) 1990 (46) 1991 (35) 1992 (48) 1993 (49) 1994 (57) 1995 (56) 1996 (59) 1997 (64) 1998 (112) 1999 (115) 2000 (120) 2001 (146) 2002 (161) 2003 (194) 2004 (287) 2005 (334) 2006 (426) 2007 (412) 2008 (480) 2009 (312) 2010 (96) 2011 (66) 2012 (68) 2013 (82) 2014 (70) 2015 (90) 2016 (77) 2017 (75) 2018 (60) 2019 (16)
Publication types (Num. hits)
article(1893) incollection(8) inproceedings(2509) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3273 occurrences of 1941 keywords

Results
Found 4411 publication records. Showing 4411 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
69Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam The price of anarchy in network creation games. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF routing, nash equilibrium, network design, price of anarchy
65Zhao-Xuan Shen, Ching Chuen Jong Functional area lower bound and upper bound on multicomponentselection for interval scheduling. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
61Syed Ali Jafar, Andrea J. Goldsmith Isotropic fading vector broadcast Channels: The scalar upper bound and loss in degrees of freedom. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
58Kenneth E. Hild II, Deniz Erdogmus, José Carlos Príncipe Experimental upper bound for the performance of convolutive source separation methods. Search on Bibsonomy IEEE Trans. Signal Processing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
58Jinjun Chen, Yun Yang 0001 Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems. Search on Bibsonomy SKG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Jinlu Li, Kaddour Boukaabar Singular Points and an Upper Bound of Medians in Upper Semimodular Lattices. Search on Bibsonomy Order The full citation details ... 2000 DBLP  DOI  BibTeX  RDF majority rule, semimodular lattice, median, singular point
49Liam Keliher, Henk Meijer, Stafford E. Tavares New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. Search on Bibsonomy EUROCRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF substitution-permutation networks, maximum average linear hull probability, provable security, linear cryptanalysis
49Martin B. Haugh, Ashish Jain Path-wise estimators and cross-path regressions: an application to evaluating portfolio strategies. Search on Bibsonomy Winter Simulation Conference The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
49Wael A. Hashlamoun, Pramod K. Varshney, V. N. S. Samarasooriya A Tight Upper Bound on the Bayesian Probability of Error. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF tight upper bound, Bayesian probability, minimum error probability, pattern recognition, probability, decision theory, Bayes methods, statistical pattern recognition
47Liam Keliher, Henk Meijer, Stafford E. Tavares Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
47Daniel Kunkle, Gene Cooperman Twenty-six moves suffice for Rubik's cube. Search on Bibsonomy ISSAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Rubik's cube, disk-based methods, fast multiplication, upper bound, permutation groups
46Xiuzhen Huang, Jing Lai Maximum Common Subgraph: Upper Bound and Lower Bound Results. Search on Bibsonomy IMSCCS (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Laura Bozzelli, Salvatore La Torre Decision Problems for Lower/Upper Bound Parametric Timed Automata. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Timothy M. Chan On levels in arrangements of curves, iii: further improvements. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF k-levels, k-sets, arrangements, combinatorial geometry
44Theo G. Swart, Hendrik C. Ferreira A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
44Yun-Hong Lee, Albert Mo Kim Cheng Dynamic Optimization for Real-Time Rule-Based Systems Using Predicate Dependency. Search on Bibsonomy IEEE Real Time Technology and Applications Symposium The full citation details ... 2000 DBLP  DOI  BibTeX  RDF real-time rule-based expert system, EQL, response time upper bound, predicate dependency list, optimization, timing analysis
44Toshiyuki Miyamoto, Sadatoshi Kumagai Calculating Place Capacity for Petri Nets Using Unfoldings. Search on Bibsonomy ACSD The full citation details ... 1998 DBLP  DOI  BibTeX  RDF place capacity, Petri net, upper bound, unfolding, maximum clique
43Franz Baader Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems. Search on Bibsonomy RTA The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
42Ilia Binder, Mark Braverman The complexity of simulating Brownian Motion. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
42Leah Epstein On-Line Variable Sized Covering. Search on Bibsonomy COCOON The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
42Paul Horton, Wataru Fujibuchi An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. Search on Bibsonomy CPM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
42Ká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 Discrete & Computational Geometry The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
42Benedito J. B. Fonseca Jr. An augmented graph-based coloring scheme to derive upper bounds for the performance of distributed schedulers in CSMA-based mobile ad hoc networks. Search on Bibsonomy IWCMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF coloring schemes, graph-based coloring schemes, performance upper bound, mobile ad hoc networks, graph theory, 802.11, scheduling algorithms, CSMA
40Pramod Lakshmi Narasimha, Michael T. Manry, Francisco Maldonado Upper Bound on Pattern Storage in Feedforward Networks. Search on Bibsonomy IJCNN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Uli Wagner 0001 On a Geometric Generalization of the Upper Bound Theorem. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Ahmed El-Amawy Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF constant skew bound, arbitrarily large computing structures, communicating cells, skew upper bound, maximum clocking rate, 2-D mesh framework, node design, nonplanar structures, parallel architectures, stability, hypercubes, network topology, synchronisation, hypercube networks, clocks, clock skew, global synchronization
39Shahram 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 IEEE Trans. Information Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
38Marc Glisse, Sylvain Lazard An Upper Bound on the Average Size of Silhouettes. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Apparent boundary, Contour generator, Profile, Upper bound, Silhouette, Polyhedron, Average, Rim
38Marc Glisse An upper bound on the average size of silhouettes. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2006 DBLP  DOI  BibTeX  RDF upper bound, silhouette, polyhedron
38Steven D. Kugelmass, Kenneth Steiglitz An Upper Bound on Expected Clock Skew in Synchronous Systems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1990 DBLP  DOI  BibTeX  RDF expected clock skew, tree distribution systems, synchronously clocked processing elements, buffer stage, VLSI constraints, H-tree, multiprocessor interconnection networks, statistical model, upper bound, synchronous systems, propagation delays
38János Pach, William L. Steiger, Endre Szemerédi An Upper Bound on the Number of Planar k-Sets Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF planar k-sets, hyperplane II, upper bound, geometry, points, combinatorics
38Yaron I. Gold, Shlomo Moran Estimating Metrical Change in Fully Connected Mobile Networks - A Least Upper Bound on the Worst Case. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1988 DBLP  DOI  BibTeX  RDF metrical change, least upper bound, virtual token passing, collision-free access control, VTP networks, mobile radio systems, protocols, local area networks, mobile networks, time division multiplexing, multi-access systems
38Guowen Han, Yuanyuan Yang Scheduling and performance analysis of multicast interconnects. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Quality-of-service (QoS), Approximation algorithms, Multicast, Interconnects, Scheduling algorithms, Random graph, Conflict graph
38Qi Wu 0002, Yongqiang Xiong, Qian Zhang 0001, Zihua Guo, Xiang-Gen Xia, Zhongcheng Li Joint routing and topology formation in multihop UWB networks. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Gudmund Skovbjerg Frandsen, Peter Frands Frandsen Dynamic Matrix Rank. Search on Bibsonomy ICALP (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri Selective families, superimposed codes, and broadcasting on unknown radio networks. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
37Gökhan Muzaffer Güvensen, Ali Özgür Yilmaz An upper bound for limited rate feedback MIMO capacity. Search on Bibsonomy IEEE Trans. Wireless Communications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Tsong Yueh Chen, Robert G. Merkel An upper bound on software testing effectiveness. Search on Bibsonomy ACM Trans. Softw. Eng. Methodol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF failure patterns, failure-causing inputs, testing effectiveness metrics, Software testing, random testing, adaptive random testing
37Kouzou Ohara, Masahiro Hara, Kiyoto Takabayashi, Hiroshi Motoda, Takashi Washio Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining. Search on Bibsonomy PKAW The full citation details ... 2008 DBLP  DOI  BibTeX  RDF discriminative subgraph, data mining, Graph mining, information gain
37Juan Xu, Yongfa Hong, Changjun Jiang, Lin Chen Upper Bound on Operational Lifetime of Ultra Wide Band Sensor Network. Search on Bibsonomy WASA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
37Jun Inagaki, Miki Haseyama GA-based applications for routing with an upper bound constraint. Search on Bibsonomy ISCAS (3) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Jinjun Chen, Yun Yang 0001 Multiple Temporal Consistency States for Dynamical Verification of Upper Bound Constraints in Grid Workflow Systems. Search on Bibsonomy e-Science The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Keivan Navaie, Ahmad R. Sharafat An Upper Bound on Air Interface Blocking Probability in Multiservice CDMA Networks. Search on Bibsonomy IJWIN The full citation details ... 2003 DBLP  DOI  BibTeX  RDF multiservice CDMA, Blocking probability, Chernoff bound
37Zhanyi Hu, Fuchao Wu A Note on the Number of Solutions of the Noncoplanar P4P Problem. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF The Noncoplanar P4P Problem, upper bound, rigid transformation
37Ciprian Borcea, Ileana Streinu On the number of embeddings of minimally rigid graphs. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Cayley-Menger variety, lower bound, upper bound, graph embedding, rigidity, distance geometry
36Sunil Arya, Theocharis Malamatos, David M. Mount On the importance of idempotence. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, range searching, idempotence
36Xian Cheng, Oliver C. Ibe Reliability of a Class of Multistage Interconnection Networks. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF extra-stage interconnectionnetworks, fault-free path, input-output pair, networkreliability, broadcast reliability, recursive expression, lower bound, probability, multiprocessor interconnection networks, upper bound, multistage interconnection networks, tight bounds, reliability theory, terminal reliability
35Jawwad Shamsi, Monica Brockmeyer SyncProbe: Providing Assurance of Message Latency through Predictive Monitoring of Internet Paths. Search on Bibsonomy HASE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Burkhard Englert Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform. Search on Bibsonomy ISPA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Stephanie Perkins, Alexander L. Sakhnovich, Derek H. Smith On an upper bound for mixed error-correcting codes. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Wei Chen 0003, Koichi Wada On Computing the Upper Envelope of Segments in Parallel. Search on Bibsonomy ICPP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
34Moritz Hardt, Kunal Talwar On the geometry of differential privacy. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF privacy, complexity, histogram, geometry, differential privacy, statistical data analysis
34Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton Basic network creation games. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF routing, nash equilibrium, network design, price of anarchy
34Udi Boker, Orna Kupferman Co-ing Büchi Made Tight and Useful. Search on Bibsonomy LICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
34Dominique Quadri, Éric Soutif Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem. Search on Bibsonomy Operational Research The full citation details ... 2007 DBLP  DOI  BibTeX  RDF integer quadratic knapsack problem, separable objective function, direct expansion, binary expansion, piecewise interpolation
34Jay Cheng, Tien-Ke Huang, Claudio Weidmann New Bounds on the Expected Length of Optimal One-to-One Codes. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Liam Keliher Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES. Search on Bibsonomy AES Conference The full citation details ... 2004 DBLP  DOI  BibTeX  RDF SPN, MELP, MEDP, KMT2, KMT2-DC, AES, provable security, differential cryptanalysis, Rijndael, linear cryptanalysis
34Kai Zhang, Tsuyoshi Shinogi, Haruhiko Takase, Terumine Hayashi A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition. Search on Bibsonomy ASP-DAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
33Quan T. Nguyen, Saïd Bettayeb The upper bound and lower bound of the genus of pancake graphs. Search on Bibsonomy ISCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Krishnamurthy Dvijotham, Soumen Chakrabarti, Subhasis Chaudhuri New closed-form bounds on the partition function. Search on Bibsonomy Machine Learning The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Associative potential, Graphical model, Variational methods, Belief propagation, Partition function, Approximate inference
33Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes Tightening the upper bound for the minimum energy broadcasting. Search on Bibsonomy Wireless Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Minimums panning tree, Ad hoc networks, Multi-hop, Approximation factor
33Liang-Wei Huang, Wern-Ho Sheen, Tsang-Wei Yu A Tight BER Upper Bound for Bit-Interleaved Coded Modulation with Square QAM and Gray Labeling. Search on Bibsonomy IEEE Trans. Wireless Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Jun Chen, Xin Zhang 0006, Toby Berger, Stephen B. Wicker An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Two parallel processors, Semi-on-line, Scheduling, Competitive analysis
33Uli Wagner 0001, Emo Welzl A Continuous Analogue of the Upper Bound Theorem. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
33Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks On the totalk-diameter of connection networks. Search on Bibsonomy ISTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network
33Shyamal K. Chowdhury The Mean Resequencing Delay for M/H_K/infty Systems. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF mean resequencing delay, packet transmission times, Poisson stream, K-stage hyperexponential transmission time distribution, equal capacity links, asymptotic bound analysis, computer networks, queueing theory, packet switching, upper bound, electronic messaging, destination nodes
33Fang-Wei Fu, Shu-Tao Xia The characterization of binary constant weight codes meeting the bound of Fu and Shen. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 05B30, 05B05, AMS Classifications 94B65
32Cong Ling 0001 Generalized Union Bound for Space-Time Codes. Search on Bibsonomy IEEE Trans. Communications The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Hiroshi Era, Morimasa Tsuchiya On upper bound graphs whose complements are also upper bound graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
31Chao Tian, Soheil Mohajer, Suhas N. Diggavi On the Symmetric Gaussian Multiple Description Rate-Distortion Function. Search on Bibsonomy DCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF rate-distortion function, Multiple descriptions
31Chen Yu, Yasushi Inoguchi, Susumu Horiguchi Overall Blocking Behavior Analysis on Banyan-Based Optical Switching Networks Under Crosstalk Constraint. Search on Bibsonomy NPC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF vertical stacking optical banyan, degree of crosstalk, blocking probability, banyan networks, Optical switching networks
31Chen Yu, Xiaohong Jiang, Susumu Horiguchi, Minyi Guo Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF horizontal expansion, vertical stacking, blocking probability, banyan networks, Optical switching networks
31Alexander Schrijver New code upper bounds from the Terwilliger algebra and semidefinite programming. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Steven S. Seiden, Rob van Stee New Bounds for Multidimensional Packing. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Box packing, Approximation algorithms, Online algorithms, Bin packing
31Steven S. Seiden, Rob van Stee New bounds for multi-dimensional packing. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
30Itai Ashlagi, Shahar Dobzinski, Ron Lavi An optimal lower bound for anonymous scheduling mechanisms. Search on Bibsonomy EC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF scheduling, incentive compatibility
30Abbas El Gamal, Navid Hassanpour, James P. Mammen Relay Networks With Delays. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Jyothiram Kasturi, Rajesh Sundaresan Sequence Design for Symbol-Asynchronous CDMA with Power or Rate Constraints. Search on Bibsonomy COMSWARE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Lei Ying, R. Srikant, Atilla Eryilmaz, Geir E. Dullerud A Large Deviations Analysis of Scheduling in Wireless Networks. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Mihai Patrascu, Erik D. Demaine Tight bounds for the partial-sums problem. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
30Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode Nashification and the Coordination Ratio for a Selfish Routing Game. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Nir Andelman, Yishay Mansour, An Zhu Competitive queueing policies for QoS switches. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
30Yuriy Tarannikov, Peter Korolev, Anton Botev Autocorrelation Coefficients and Correlation Immunity of Boolean Functions. Search on Bibsonomy ASIACRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF autocorrelation coefficients, global avalanche characteristics, Boolean functions, stream ciphers, resiliency, nonlinearity, bounds, balancedness, correlation immunity, Walsh Transform
30Michael J. Quinn, Narsingh Deo An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. Search on Bibsonomy BIT The full citation details ... 1986 DBLP  BibTeX  RDF
30George S. Lueker Improved bounds on the average length of longest common subsequences. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences
30Jorge F. Silva, Shrikanth Narayanan Upper Bound Kullback-Leibler Divergence for Transient Hidden Markov Models. Search on Bibsonomy IEEE Trans. Signal Processing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Fang Wang, Lisheng Ren, Guifa Teng The Upper Bound of Coverage on Fixed Energy Budget in Wireless Sensor Networks. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF WSN, ad-hoc networks, wireless, coverage
30Fang Wang, Guifa Teng, Lisheng Ren The Upper Bound of The Number of Nodes On Fixed Energy Budget in Wireless Sensor Networks. Search on Bibsonomy SNPD (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Alberto Perotti, Sergio Benedetto An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Paolo Valente, Giuseppe Lipari An Upper Bound to the Lateness of Soft Real-Time Tasks Scheduled by EDF on Multiprocessors. Search on Bibsonomy RTSS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Peng-fei Chuang, Resit Sendag, David J. Lilja Improving Data Cache Performance via Address Correlation: An Upper Bound Study. Search on Bibsonomy Euro-Par The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Xuerong Feng, Z. Meng, Ivan Hal Sudborough Improved Upper Bound for Sorting by Short Swaps. Search on Bibsonomy ISPAN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Alessandra Nardi, Haibo Zeng, Joshua L. Garrett, Luca Daniel, Alberto L. Sangiovanni-Vincentelli A Methodology for the Computation of an Upper Bound on Nose Current Spectrum of CMOS Switching Activity. Search on Bibsonomy ICCAD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Stein W. Wallace, Chanaka Edirisinghe Stochastic Programs with Recourse: Upper Bounds. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Upper bound, Stochastic programming
30Sang Won Bae, Kyung-Yong Chwa The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2009 DBLP  DOI  BibTeX  RDF farthest-site voronoi diagram, polygonal domain, shortest obstacle-free path, tight upper bound, geodesic
30Haifeng Yu, Amin Vahdat The costs and limits of availability for replicated services. Search on Bibsonomy ACM Trans. Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF continuous consistency, replication, Availability, upper bound, network services, trade-off
30Hiroyuki Miyazawa, Thomas Erlebach An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. Search on Bibsonomy J. Scheduling The full citation details ... 2004 DBLP  DOI  BibTeX  RDF interval scheduling, lower bound, randomized algorithm, competitive analysis, upper bound, on-line algorithm
30Vasudevan V. Vinod, Hiroshi Murase Image retrieval using efficient local-area matching. Search on Bibsonomy Mach. Vis. Appl. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Efficient search, Upper bound pruning, Image retrieval, Color matching, Precision and recall
Displaying result #1 - #100 of 4411 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license