Search results for "upper bounds"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Andrew Richards	On upper bounds for the tail distribution of geometric sums of subexponential random variables.	Queueing Syst.	2009	DBLP DOI BibTeX RDF	Geometric sum, GI/GI/1, Upper bounds, Subexponential distribution
3	Floris Geerts, Bart Goethals, Jan Van den Bussche	Tight upper bounds on the number of candidate patterns.	ACM Trans. Database Syst.	2005	DBLP DOI BibTeX RDF	Data mining, upper bounds, frequent patterns
3	Thierry Benoist, Benoît Rottembourg	Upper bounds for revenue maximization in a satellite scheduling problem.	4OR	2004	DBLP DOI BibTeX RDF	concave costs, Russian Dolls, Upper bounds, valid inequalities
2	Michael J. Collins	Upper bounds for parent-identifying set systems.	Des. Codes Cryptography	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 94A60
2	Giusi Alfano, Michele Garetto, Emilio Leonardi	Capacity Scaling of Wireless Networks with Inhomogeneous Node Density: Upper Bounds.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
2	Huiyong Liao, Haiquan Wang, Xiang-Gen Xia	Some Designs and Normalized Diversity Product Upper Bounds for Lattice-Based Diagonal and Full-Rate Space-Time Block Codes.	IEEE Transactions on Information Theory	2009	DBLP DOI BibTeX RDF
2	Didier Coquin, Philippe Bolon	Lower and Upper Bounds for Scaling Factors Used for Integer Approximation of 3D Anisotropic Chamfer Distance Operator.	DGCI	2009	DBLP DOI BibTeX RDF	Anisotropic lattice, Distance transformation, Chamfer distance
2	Marco Gaboardi, Romain Péchoux	Upper Bounds on Stream I/O Using Semantic Interpretations.	CSL	2009	DBLP DOI BibTeX RDF
2	Yael Ben-Haim, Simon Litsyn	Improved Upper Bounds on the Reliability Function of the Gaussian Channel.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Vera Kurková, Marcello Sanguineti	Geometric Upper Bounds on Rates of Variable-Basis Approximation.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan	Least Upper Bounds for Probability Measures and Their Applications to Abstractions.	CONCUR	2008	DBLP DOI BibTeX RDF
2	Behzad Sharif, Yoram Bresler	Upper bounds on aliasing error energy for multidimensional sampling of nonbandlimited signals.	ICASSP	2008	DBLP DOI BibTeX RDF
2	Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf	Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing.	ICALP	2008	DBLP DOI BibTeX RDF
2	Soheil Feizi-Khankandi, Farid Ashtiani	Lower and Upper Bounds for Throughput Capacity of a Cognitive Ad Hoc Network Overlaid on a Cellular Network.	WCNC	2008	DBLP DOI BibTeX RDF
2	Michael J. Collins	Upper Bounds for Set Systems with the Identifiable Parent Property.	ICITS	2008	DBLP DOI BibTeX RDF
2	Cong Ling	Improved Upper Bounds for Approximate Lattice Decoding With Dual-Basis Reduction.	ICC	2008	DBLP DOI BibTeX RDF
2	Nick Trebon, Peter H. Beckman	Empirical-based probabilistic upper bounds for urgent computing applications.	CLUSTER	2008	DBLP DOI BibTeX RDF
2	Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla	Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis.	SAS	2008	DBLP DOI BibTeX RDF
2	Jochen Eisinger	Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract).	CSL	2008	DBLP DOI BibTeX RDF
2	Junsheng Han, Paul H. Siegel	Improved Upper Bounds on Stopping Redundancy.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
2	Claude Carlet, Sihem Mesnager	Improving the Upper Bounds on the Covering Radii of Binary Reed-Muller Codes.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
2	Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto	Improved Upper Bounds on Binary Identifying Codes.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
2	Pulkit Grover, Ajit Kumar Chaturvedi	Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
2	Moshe Twitto, Igal Sason, Shlomo Shamai	Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
2	Jing-jing Tian, Xin-sheng Liu, Zhongfu Zhang, Fang'an Deng	Upper Bounds on the D(beta)-Vertex-Distinguishing Edge-Chromatic Numbers of Graphs.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF
2	Ugur Kuter, Jiaqiao Hu	Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning.	SARA	2007	DBLP DOI BibTeX RDF
2	Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote	New upper bounds on the quality of the PCA bounding boxes in r2 and r3.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	principal component analysis, bounding boxes
2	Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman	Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars.	SOFSEM	2007	DBLP DOI BibTeX RDF
2	Ydo Wexler, Dan Geiger	Variational Upper Bounds for Probabilistic Phylogenetic Models.	RECOMB	2007	DBLP DOI BibTeX RDF
2	Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek	Lower and upper bounds in zone-based abstractions of timed automata.	STTT	2006	DBLP DOI BibTeX RDF	Verification, Abstraction, Timed automata, Extrapolation
2	Yael Ben-Haim, Simon Litsyn	Upper bounds on the rate of LDPC codes as a function of minimum distance.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
2	Shraga I. Bross, Simon Litsyn	Improved Upper Bounds for Codes With Unequal Error Protection.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
2	Jay Cheng, Tien-Ke Huang	Upper bounds on exponentiated expected length of optimal one-to-one codes.	IWCMC	2006	DBLP DOI BibTeX RDF	anti-redundancy, non-prefix codes, one-to-one codes, source coding
2	Benedito 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.	IWCMC	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
2	Arist Kojevnikov, Alexander S. Kulikov	A new approach to proving upper bounds for MAX-2-SAT.	SODA	2006	DBLP DOI BibTeX RDF
2	Kazuho Watanabe, Motoki Shiga, Sumio Watanabe	Upper Bounds for Variational Stochastic Complexities of Bayesian Networks.	IDEAL	2006	DBLP DOI BibTeX RDF
2	Jay Cheng, Tien-Ke Huang	New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes.	DCC	2006	DBLP DOI BibTeX RDF
2	Doru Stefanescu	Inequalities on Upper Bounds for Real Polynomial Roots.	CASC	2006	DBLP DOI BibTeX RDF
2	Alkiviadis G. Akritas, Adam W. Strzebonski, Panagiotis S. Vigklas	Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials.	Computing	2006	DBLP DOI BibTeX RDF	positive roots, polynomial real root isolation, Upper bounds
2	Jianer Chen, Iyad A. Kanj, Ge Xia	Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.	Algorithmica	2005	DBLP DOI BibTeX RDF	Exact algorithm, Independent set, Vertex cover, Parameterized algorithm
2	Martin J. Wainwright, Tommi Jaakkola, Alan S. Willsky	A new class of upper bounds on the log partition function.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
2	Alexander Schrijver	New code upper bounds from the Terwilliger algebra and semidefinite programming.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
2	Guillaume Chelius, Eric Fleury, Thierry Mignon	Lower and Upper Bounds for Minimum Energy Broadcast and Sensing Problems in Sensor Networks.	ICPADS	2005	DBLP DOI BibTeX RDF
2	Joanna Jedrzejowicz, Piotr Jedrzejowicz	New Upper Bounds for the Permutation Flowshop Scheduling Problem.	IEA/AIE	2005	DBLP DOI BibTeX RDF
2	Monica Kristiansen	Finding Upper Bounds for Software Failure Probabilities - Experiments and Results.	SAFECOMP	2005	DBLP DOI BibTeX RDF
2	Martin Hirt, Jesper Buus Nielsen	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.	ASIACRYPT	2005	DBLP DOI BibTeX RDF
2	H. Brendan McMahan, Maxim Likhachev, Geoffrey J. Gordon	Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees.	ICML	2005	DBLP DOI BibTeX RDF
2	Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros	Cages: constructions and new upper bounds.	ISPAN	2005	DBLP DOI BibTeX RDF
2	Damien Woods	Upper Bounds on the Computational Power of an Optical Model of Computation.	ISAAC	2005	DBLP DOI BibTeX RDF
2	Gus Gutoski	Upper Bounds for Quantum Interactive Proofs with Competing Provers.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
2	Deniz Erdogmus, Jose C. Principe	Lower and Upper Bounds for Misclassification Probability Based on Renyi's Information.	VLSI Signal Processing	2004	DBLP DOI BibTeX RDF	classifier performance, Renyi's entropy, Fano's inequality, error bounds
2	Matthew J. Streeter	Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions.	GECCO	2004	DBLP DOI BibTeX RDF
2	Naveen Garg, Rohit Khandekar	Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries.	ESA	2004	DBLP DOI BibTeX RDF
2	Lisa Fleischer	A fast approximation scheme for fractional covering problems with variable upper bounds.	SODA	2004	DBLP DOI BibTeX RDF
2	Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek	Lower and Upper Bounds in Zone Based Abstractions of Timed Automata.	TACAS	2004	DBLP DOI BibTeX RDF
2	Marco Antonio Cruz-Chavez, Juan Frausto Solís	Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds.	ICAISC	2004	DBLP DOI BibTeX RDF
2	Michel Vasquez, Jin-Kao Hao	Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	partition, tabu search, bounds, constraint relaxation, branch & bound
2	Behrooz Parhami	Tight Upper Bounds on the Minimum Precision Required of the Divisor and the Partial Remainder in High-Radix Division.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	digit-selector PLA, high-radix division, p-d plot, quotient digit selection, SRT division, Digit-recurrence division
2	Marco A. Boschetti, Aristide Mingozzi	The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds.	4OR	2003	DBLP DOI BibTeX RDF	Lower Bounds, Heuristic Algorithms, Cutting and Packing
2	Cyriel Van Nuffelen, Kristel Van Rompay	Upper bounds on the independence and the clique covering number.	4OR	2003	DBLP DOI BibTeX RDF	clique covering number, eigenvalues, adjacency matrix, independence number
2	Massimiliano Sala	Upper Bounds on the Dual Distance of BCH(255, k).	Des. Codes Cryptography	2003	DBLP DOI BibTeX RDF	shortened code, dual distance, upper bound, BCH codes
2	François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre	New Lower and Upper Bounds for Graph Treewidth.	WEA	2003	DBLP DOI BibTeX RDF
2	Niv Buchbinder, Erez Petrank	Lower and Upper Bounds on Obtaining History Independence.	CRYPTO	2003	DBLP DOI BibTeX RDF
2	Michael Alekhnovich, Eli Ben-Sasson	Linear Upper Bounds for Random Walk on Small Density Random 3-CNF.	FOCS	2003	DBLP DOI BibTeX RDF
2	Jianer Chen, Iyad A. Kanj, Ge Xia	Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.	ISAAC	2003	DBLP DOI BibTeX RDF
2	Taizo Shirai, Shoji Kanamaru, George Abe	Improved Upper Bounds of Differential and Linear Characteristic Probability for Camellia.	FSE	2002	DBLP DOI BibTeX RDF
2	Hendrik Jan Hoogeboom, Nike van Vugt	Upper Bounds for Restricted Splicing.	Formal and Natural Computing	2002	DBLP DOI BibTeX RDF
2	Alf Kimms	Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds.	Annals OR	2001	DBLP DOI BibTeX RDF	heuristics, Lagrangian relaxation, resource-constrained project scheduling, net present value
2	Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Stammermann, Arne Schulz, Enrico Macii, Wolfgang Nebel	Estimation of lower and upper bounds on the power consumption from scheduled data flow graphs.	IEEE Trans. VLSI Syst.	2001	DBLP DOI BibTeX RDF
2	Burkhard Monien, Robert Preis	Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.	MFCS	2001	DBLP DOI BibTeX RDF	local improvement, graph partitioning, regular graphs, bisection width
2	Ray Jinzhu Chen	A Hybrid Solution of Fork/Join Synchronization in Parallel Queues.	IEEE Trans. Parallel Distrib. Syst.	2001	DBLP DOI BibTeX RDF	Fork/join queuing system, modeling and analysis, dynamic-bubblesort analysis, synchronization, upper bounds, parallel queues
2	Laura Heinrich-Litan, Paul Molitor	Least Upper Bounds for the Size of OBDDs Using Symmetry Properties.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	upper worst case bounds, partial symmetric Boolean functions, Binary decision diagrams, variable ordering
2	Rolf Niedermeier, Peter Rossmanith	New Upper Bounds for MaxSat.	ICALP	1999	DBLP DOI BibTeX RDF
2	Rolf Niedermeier, Peter Rossmanith	Upper Bounds for Vertex Cover Further Improved.	STACS	1999	DBLP DOI BibTeX RDF
2	Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh	Valid Inequalities for Problems with Additive Variable Upper Bounds.	IPCO	1999	DBLP DOI BibTeX RDF
2	Venkatesh Raman, Sarnath Ramnath	Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage.	SWAT	1998	DBLP DOI BibTeX RDF
2	Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra	Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables.	IPCO	1998	DBLP DOI BibTeX RDF
2	Junbiao Zhang, Joseph Y. Hui	Optimal smoothness results and approximation techniques for real-time VBR video traffic smoothing. (PDF / PS)	IEEE Real-Time Systems Symposium	1997	DBLP DOI BibTeX RDF	optimal smoothness results, real time VBR video traffic smoothing, future video frames, smoothing process, real time video smoothing methods, benchmark algorithm, smoothing results, smoothness upper bounds, global optimization, interactive video, variable bit rate video, approximation techniques, smoothness parameters
2	Jun Sun 0002, Jane W.-S. Liu	Bounding completion times of jobs with arbitrary release times and variable execution times. (PDF / PS)	IEEE Real-Time Systems Symposium	1996	DBLP DOI BibTeX RDF	job completion time bounding, arbitrary release times, variable execution times, linear precedence constraints, priority-driven basis, simulation, scheduling, performance, real-time systems, real-time systems, complexity, upper bounds, workload
2	Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis	New Upper Bounds for Generalized Intersection Searching Problems.	ICALP	1995	DBLP DOI BibTeX RDF
2	Kamal Kumar Jain, V. Rajaraman	Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	lower time bound, upper time bound, multiprocessor optimal schedules, minimum processing time, directed acyclic task graph, worst case behavior, minimum processor number, randomly generated dense task graphs, scheduling, performance evaluation, parallel algorithms, parallel processing, directed graphs, minimisation
2	Mark A. Heap, M. Ray Mercer	Least Upper Bounds an OBDD Sizes.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	least upper bounds, OBDD sizes, exact equations, nonterminal vertexes, reduced ordered binary decision diagrams, Boolean functions, decoding
2	Vlado Dancík, Mike Paterson	Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.	STACS	1994	DBLP DOI BibTeX RDF	Classification computational complexity, stringmatching, average-case analysis
2	Mario Szegedy	A note on the Theta number of Lovász and the generalized Delsarte bound	FOCS	1994	DBLP DOI BibTeX RDF	semidefinite, /spl theta/ number, generalized Delsarte bound, convex programming upper bounds, programming upper bounds, convex programming
2	Micha Sharir	Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions	FOCS	1993	DBLP DOI BibTeX RDF	almost tight upper bounds, higher dimensions, constant maximum degree, constant of proportionality, Davenport-Schinzel sequences, randomized algorithm, combinatorial complexity, lower envelopes, surface patches
2	Anurag Kumar, Rajeev Shorey	Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System.	IEEE Trans. Parallel Distrib. Syst.	1993	DBLP DOI BibTeX RDF	stochastic fork-join jobs, probabilistic allocation of tasks, associated random variables, diffusion limits, simulations, scheduling, scheduling, performance evaluation, performance analysis, parallel processing, lower bounds, delays, queueing theory, digital simulation, upper bounds, stochastic processes, multicomputer system, parallel processing system, queueing delays, exact analysis
2	Sridhar Madala, James B. Sinclair	Performance of Synchronous Parallel Algorithms with Regular Structures.	IEEE Trans. Parallel Distrib. Syst.	1991	DBLP DOI BibTeX RDF	distribution driven simulations, synchronous parallelalgorithms, mean execution time, program-driven simulations, average execution time, multiphasealgorithms, execution time bounds, scheduling, performance evaluation, parallel algorithms, parallel programming, upper bounds, bounding, scheduling policies, partitioning algorithm, parallel tasks, asymptotic approximations, regular structures
2	Valmir C. Barbosa	Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	randomly generated systems, distributed parallel programs, unavailability, message buffers, message buffering space, buffer usage, NP-hard optimization problems, computational complexity, parallel programming, concurrency, heuristic, upper bounds, programming theory, communication channels, deadlock prevention, process execution, communication deadlocks
2	Mark H. Overmars, Chee-Keng Yap	New upper bounds in Klee's measure problem (extended abstract)	FOCS	1988	DBLP DOI BibTeX RDF	Klee measure problem, time-space upper bound, Euclidean d-space, inclusion/exclusion principle, trellises, partition, streaming, upper bounds, dimensions
2	Sverrir Olafsson, Yaser S. Abu-Mostafa	The Capacity of Multilevel Threshold Functions.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	information capacity, multilevel threshold functions, input set, lower bounds, topology, topology, information theory, information theory, upper bounds
2	Jürg Nievergelt, C. K. Wong	Upper Bounds for the Total Path Length of Binary Trees.	J. ACM	1973	DBLP DOI BibTeX RDF
1	Rafael R. Kamalian, Petros A. Petrosyan	A note on upper bounds for the maximum span in interval edge-colorings of graphs.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Artur Khojabaghyan, Vahan V. Mkrtchyan	On upper bounds for parameters related to the construction of special maximum matchings.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou	Upper bounds on minimum balanced bipartitions.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Chun-Hung Liu, Gerard Jennhwa Chang	Upper bounds on Roman domination numbers of graphs.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Jinsong Chen, Jianping Liu, Xiaofeng Guo	Some upper bounds for the atom-bond connectivity index of graphs.	Appl. Math. Lett.	2012	DBLP DOI BibTeX RDF
1	Meilian Liang, Xiaodong Xu, Jiarong Liang, Zehui Shao	Upper bounds on the connection probability for 2-D meshes and tori.	J. Parallel Distrib. Comput.	2012	DBLP DOI BibTeX RDF
1	David Diamondstone	Low upper bounds in the LR degrees.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Xueliang Li, Yuefang Sun	Upper Bounds for the Rainbow Connection Numbers of Line Graphs.	Graphs and Combinatorics	2012	DBLP DOI BibTeX RDF
1	Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate	Upper Bounds on the Capacity of Binary Channels with Causal Adversaries	CoRR	2012	DBLP BibTeX RDF