Search results for "bounds"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz	Improved second-order bounds for prediction with expert advice.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Individual sequences, Prediction with expert advice, Exponentially weighted averages
19	Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Poor	Finite-Dimensional Bounds on BBZm and Binary LDPC Codes With Belief Propagation Decoders.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
19	Zihuai Lin, Tor Aulin	On Joint Source and Channel Coding Using Trellis Coded CPM: Analytical Bounds on the Channel Distortion.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
19	Susana Díaz, Susana Montes, Bernard De Baets	Transitivity Bounds in Additive Fuzzy Preference Structures.	IEEE Trans. Fuzzy Syst.	2007	DBLP DOI BibTeX RDF
19	Alireza Keshavarz-Haddad, Rudolf H. Riedi	Bounds for the capacity of wireless multihop networks imposed by topology and demand.	MobiHoc	2007	DBLP DOI BibTeX RDF	capacity of wireless networks, transport capacity
19	Nati Linial, Adi Shraibman	Lower bounds in communication complexity based on factorization norms.	STOC	2007	DBLP DOI BibTeX RDF	factorization norms, communication complexity, discrepancy, Fourier analysis
19	Amit Chakrabarti	Lower Bounds for Multi-Player Pointer Jumping.	CCC	2007	DBLP DOI BibTeX RDF
19	Ryan Williams 0001	Inductive Time-Space Lower Bounds for Sat and Related Problems.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	68Q17, Subject classification
19	Yael Ben-Haim, Simon Litsyn	Upper bounds on the rate of LDPC codes as a function of minimum distance.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
19	Tong Zhang 0001	Information-theoretic upper and lower bounds for statistical estimation.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
19	Giuliano Casale, Richard R. Muntz, Giuseppe Serazzi	A New Class of Non-Iterative Bounds for Closed Queueing Networks.	MASCOTS	2006	DBLP DOI BibTeX RDF
19	Mihai Patrascu, Mikkel Thorup	Higher Lower Bounds for Near-Neighbor and Further Rich Problems.	FOCS	2006	DBLP DOI BibTeX RDF
19	Ioannis Kontoyiannis, Luis Alfonso Lastras-Montaño, Sean P. Meyn	Exponential bounds and stopping rules for MCMC and general Markov chains.	VALUETOOLS	2006	DBLP DOI BibTeX RDF
19	Vivek N. Darera, Lawrence Jenkins	Utilization Bounds for RM Scheduling on Uniform Multiprocessors.	RTCSA	2006	DBLP DOI BibTeX RDF
19	Sophie Laplante	Lower Bounds Using Kolmogorov Complexity.	CiE	2006	DBLP DOI BibTeX RDF
19	Iannis Tourlakis	New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy.	CCC	2006	DBLP DOI BibTeX RDF
19	Arindam Banerjee 0001	On Bayesian bounds.	ICML	2006	DBLP DOI BibTeX RDF
19	Vebjorn Ljosa, Arnab Bhattacharya 0001, Ambuj K. Singh	Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds.	EDBT	2006	DBLP DOI BibTeX RDF
19	Andrea Conti 0001, Moe Z. Win, Marco Chiani	Invertible bounds for M-QAM in Rayleigh fading.	IEEE Trans. Wirel. Commun.	2005	DBLP DOI BibTeX RDF
19	Jun (Jim) Xu, Richard J. Lipton	On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	quality of service, computational complexity, decision tree, packet scheduling, delay bound
19	Ingmar Land, Simon Huettinger, Peter A. Hoeher, Johannes B. Huber	Bounds on information combining.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
19	Gal Ben-David, David Malah	Bounds on the performance of vector-quantizers under channel errors.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
19	Radu Rugina, Martin C. Rinard	Symbolic bounds analysis of pointers, array indices, and accessed memory regions.	ACM Trans. Program. Lang. Syst.	2005	DBLP DOI BibTeX RDF	static race detection, parallelization, Symbolic analysis
19	Omer Horvitz, Jonathan Katz	Bounds on the Efficiency of "Black-Box" Commitment Schemes.	ICALP	2005	DBLP DOI BibTeX RDF
19	Tong Zhang 0001	Localized Upper and Lower Bounds for Some Estimation Problems.	COLT	2005	DBLP DOI BibTeX RDF
19	Ryan Williams 0001	Better Time-Space Lower Bounds for SAT and Related Problems.	CCC	2005	DBLP DOI BibTeX RDF
19	Antanas Zilinskas, Julius Zilinskas	On Efficiency of Tightening Bounds in Interval Global Optimization.	PARA	2004	DBLP DOI BibTeX RDF
19	Shengyu Zhang	On the Power of Ambainis's Lower Bounds.	ICALP	2004	DBLP DOI BibTeX RDF
19	József Bíró, András Gulyás, Tamás Szénási, Zalán Heszberger	Distribution-free conservative bounds for QoS measures.	ISCC	2004	DBLP DOI BibTeX RDF
19	Peter T. Popov, Lorenzo Strigini, John H. R. May, Silke Kuball	Estimating Bounds on the Reliability of Diverse Systems.	IEEE Trans. Software Eng.	2003	DBLP DOI BibTeX RDF	demand space partitioning, subdomain testing, common-mode failure, Software fault-tolerance, design diversity
19	George S. Lueker	Improved bounds on the average length of longest common subsequences.	SODA	2003	DBLP BibTeX RDF
19	Ludmila I. Kuncheva	Error Bounds for Aggressive and Conservative AdaBoost.	Multiple Classifier Systems	2003	DBLP DOI BibTeX RDF
19	David A. McAllester	Simplified PAC-Bayesian Margin Bounds.	COLT	2003	DBLP DOI BibTeX RDF
19	Leah Epstein, Steven S. Seiden, Rob van Stee	New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.	ICALP	2002	DBLP DOI BibTeX RDF
19	Ziv Bar-Yossef, Ravi Kumar 0001, D. Sivakumar 0001	Sampling algorithms: lower bounds and applications.	STOC	2001	DBLP DOI BibTeX RDF
19	Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich	New Spectral Lower Bounds on the Bisection Width of Graphs.	WG	2000	DBLP DOI BibTeX RDF
19	Radu Rugina, Martin C. Rinard	Symbolic bounds analysis of pointers, array indices, and accessed memory regions.	PLDI	2000	DBLP DOI BibTeX RDF
19	David R. Wood	Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings.	GD	2000	DBLP DOI BibTeX RDF
19	Sumant Ramprasad, Naresh R. Shanbhag, Ibrahim N. Hajj	Information-theoretic bounds on average signal transition activity [VLSI systems].	IEEE Trans. Very Large Scale Integr. Syst.	1999	DBLP DOI BibTeX RDF
19	Vladimir Cherkassky, Xuhui Shao, Filip Mulier, Vladimir Vapnik	Model complexity control for regression using VC generalization bounds.	IEEE Trans. Neural Networks	1999	DBLP DOI BibTeX RDF
19	David P. Helmbold, Jyrki Kivinen, Manfred K. Warmuth	Relative loss bounds for single neurons.	IEEE Trans. Neural Networks	1999	DBLP DOI BibTeX RDF
19	Rajamohana Hegde, Naresh R. Shanbhag	Lower bounds on energy dissipation and noise-tolerance for deep submicron VLSI.	ISCAS (6)	1999	DBLP DOI BibTeX RDF
19	Nicolas Vayatis, Robert Azencott	Distribution-Dependent Vapnik-Chervonenkis Bounds.	EuroCOLT	1999	DBLP DOI BibTeX RDF
19	Vince Grolmusz, Gábor Tardos	Lower Bounds for (MOD p - MOD m) Circuits.	FOCS	1998	DBLP DOI BibTeX RDF
19	Juraj Hromkovic	Communication Complexity and Lower Bounds on Multilective Computations.	MFCS	1998	DBLP DOI BibTeX RDF
19	Bertrand Cabon, Simon de Givry, Gérard Verfaillie	Anytime Lower Bounds for Constraint Violation Minimization Problems.	CP	1998	DBLP DOI BibTeX RDF
19	Zhen Liu 0001, Philippe Nain, Donald F. Towsley	Exponential bounds with applications to call admission.	J. ACM	1997	DBLP DOI BibTeX RDF	exponential bound, matrix analysis, tail distribution, Markov chain, call admission control, queues, effective bandwidth, ergodicity, Markov additive process, large deviation principle
19	Jeff Erickson 0001	New Lower Bounds for Hopcroft's Problem.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
19	Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini	Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages.	MFCS	1995	DBLP DOI BibTeX RDF
19	Kaoru Kurosawa, Satoshi Obana	Combinatorial Bounds for Authentication Codes with Arbitration.	EUROCRYPT	1995	DBLP DOI BibTeX RDF
19	Michael Mitzenmacher	Bounds on the Greedy Routing Algorithm for Array Networks.	SPAA	1994	DBLP DOI BibTeX RDF
19	Vladimir I. Levenshtein	Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals.	AAECC	1993	DBLP DOI BibTeX RDF
19	Hagit Attiya, Taly Djerassi-Shintel	Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures.	WDAG	1993	DBLP DOI BibTeX RDF
19	Hai-Ping Ko, Mark E. Nadel	Elementary Lower Bounds for th Length of Refutations.	LPAR	1992	DBLP DOI BibTeX RDF
19	Warren H. Debany Jr., Carlos R. P. Hartmann	Bounds on the sizes of irredundant test sets and sequences for combinational logic networks.	J. Electron. Test.	1991	DBLP DOI BibTeX RDF	Digital logic testing, irredundant tests, test complexity, test counting
19	Soma Chaudhuri, Jennifer L. Welch	Bounds on the Costs of Register Implementations.	WDAG	1990	DBLP DOI BibTeX RDF
19	Ming Li 0001, Yaacov Yesha	New lower bounds for parallel computation.	J. ACM	1989	DBLP DOI BibTeX RDF
19	Juraj Hromkovic, Juraj Procházka	Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays.	MFCS	1988	DBLP DOI BibTeX RDF
19	Ashok K. Chandra, Steven Fortune, Richard J. Lipton	Lower Bounds for Constant Depth Circuits for Prefix Problems.	ICALP	1983	DBLP DOI BibTeX RDF
19	Nai-Kuan Tsao	Some a Posteriori Error Bounds in Floating-Point Computations.	J. ACM	1974	DBLP DOI BibTeX RDF
16	Hagit Attiya	The inherent complexity of transactional memory and what to do about it.	PODC	2010	DBLP DOI BibTeX RDF	mini-transactions, lower bounds, transactional memory
16	Lou van den Dries, Yiannis N. Moschovakis	Arithmetic complexity.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	Lower bounds for arithmetical problems, coprimeness, greatest common divisor, recursive programs
16	Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov	The complexity of obstruction-free implementations.	J. ACM	2009	DBLP DOI BibTeX RDF	perturbable objects, solo-fast implementations, step contention, lower bounds, Shared memory, memory contention
16	András Horváth, Sándor Rácz, Miklós Telek	Moments Characterization of Order 3 Matrix Exponential Distributions.	ASMTA	2009	DBLP DOI BibTeX RDF	Matrix exponential distributions, moment bounds, Phase type distributions
16	John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi	Brief announcement: collaborative measurement of upload speeds in P2P systems.	PODC	2009	DBLP DOI BibTeX RDF	lower bounds, P2P systems, bandwidth estimation
16	Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport	Brief announcement: hardness of broadcasting in wireless networks with unreliable communication.	PODC	2009	DBLP DOI BibTeX RDF	lower bounds, broadcast
16	Eyal Kushilevitz, Enav Weinreb	On the complexity of communication complexity.	STOC	2009	DBLP DOI BibTeX RDF	protocol tree, lower bounds, communication complexity, hardness of approximation, pseudo random functions
16	Jeff Abrahamson, Béla Csaba, Ali Shokoufandeh	Optimal Random Matchings on Trees and Applications.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF	Random Matching, Hierarchically Separated Trees, Supremum Bounds
16	Robert Spalek	The Multiplicative Quantum Adversary.	CCC	2008	DBLP DOI BibTeX RDF	quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems
16	Nicolas Christin, Jörg Liebeherr, Tarek F. Abdelzaher	Enhancing class-based service architectures with adaptive rate allocation and dropping mechanisms.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	best-effort bounds, scheduling, buffer management, feedback control, service differentiation
16	Peter Auer, Ronald Ortner	A new PAC bound for intersection-closed concept classes.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	PAC bounds, Intersection-closed classes
16	César Luis Alonso, José Luis Montaña	Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations.	ALT	2007	DBLP DOI BibTeX RDF	Milnor-Thom bounds, formula size, parallel computation, Concept learning, Vapnik-Chervonenkis dimension
16	Faith Ellen Fich, Danny Hendler, Nir Shavit	On the inherent weakness of conditional primitives.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Space lower bounds, Object implementations, Mutual exclusion, Conditionals
16	Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi	Byzantine disk paxos: optimal resilience with byzantine shared memory.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	T-tolerant object implementations, Lower bounds, Consensus, Byzantine failures, Wait freedom, Shared-memory emulations
16	David Liben-Nowell, Erik Vee, An Zhu	Finding longest increasing and common subsequences in streaming data.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Data-streaming model, Algorithms, Lower bounds, LCS, LIS
16	Armin Heindl, Gábor Horváth 0002, Karsten Gross	Explicit Inverse Characterizations of Acyclic MAPs of Second Order.	EPEW	2006	DBLP DOI BibTeX RDF	Acyclic Markovian arrival processes of second order, inverse characterization, moment and correlation bounds
16	Hans Georg Schaathun, Gérard D. Cohen	A Trellis-Based Bound on (2, 1)-Separating Codes.	IMACC	2005	DBLP DOI BibTeX RDF	coding bounds, separating codes, Trellis
16	Tarek F. Abdelzaher, Vivek Sharma 0004, Chenyang Lu 0001	A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks
16	Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer	What cannot be computed locally!	PODC	2004	DBLP DOI BibTeX RDF	approximation hardness, distributed algorithms, locality, lower bounds, dominating set, vertex cover, maximal independent set, maximal matching
16	Peter L. Bartlett, Shahar Mendelson, Petra Philips	Local Complexities for Empirical Risk Minimization.	COLT	2004	DBLP DOI BibTeX RDF	concentration inequalities, isomorphic coordinate projections, data-dependent complexity, Statistical learning theory, empirical risk minimization, generalization bounds
16	Xavier Dahan, Éric Schost	Sharp estimates for triangular sets.	ISSAC	2004	DBLP DOI BibTeX RDF	intrinsic bounds, polynomial systems, triangular sets
16	Micah Adler, Neil Immerman	An n! lower bound on formula size.	ACM Trans. Comput. Log.	2003	DBLP DOI BibTeX RDF	lower bounds, temporal logic, Descriptive complexity
16	Eunice E. Santos	Parallel Complexity of Matrix Multiplication.	J. Supercomput.	2003	DBLP DOI BibTeX RDF	optimality, parallel algorithms, lower bounds, matrix multiplication, linear algebra, numerical algorithms, parallel models, parallel complexity, LogP model
16	Faith E. Fich, Eric Ruppert	Hundreds of impossibility results for distributed computing.	Distributed Comput.	2003	DBLP DOI BibTeX RDF	Complexity lower bounds, Distributed computing, Impossibility results
16	Rohit Ananthakrishna, Abhinandan Das, Johannes Gehrke, Flip Korn, S. Muthukrishnan 0001, Divesh Srivastava	Efficient Approximation of Correlated Sums on Data Streams.	IEEE Trans. Knowl. Data Eng.	2003	DBLP DOI BibTeX RDF	Correlated aggregates, summary structures, a priori error bounds, IP network management, approximation, data streams
16	Philipp Woelfel	On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.	CCC	2002	DBLP DOI BibTeX RDF	Lower Bounds, BDDs, Nondeterminism, Branching Programs, Integer Multiplication
16	Stefanie Gerke, Colin McDiarmid	Channel Assignment with Large Demands.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	graph imperfection, clique-bounds, channel assignment
16	Beate Bollig, Philipp Woelfel	A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal.	STOC	2001	DBLP DOI BibTeX RDF	read-once branching programs, computational complexity, lower bounds, integer multiplication
16	Fritz Henglein, Jakob Rehof	The Complexity of Subtype Entailment for Simple Types.	LICS	1997	DBLP DOI BibTeX RDF	subtype entailment complexity, atomic entailment, coNP-completeness, complexity-theoretic marker, exponential explosion, subtype inference, structural complexity bounds, computability, satisfiability, axiomatization, linear-time algorithm
16	Andrew V. Goldberg, Satish Rao	Beyond the Flow Decomposition Barrier.	FOCS	1997	DBLP DOI BibTeX RDF	flow decomposition barrier, arc lengths, Gomory-Hu tree problem, parametric flow problem, time bound, time bounds, combinatorial mathematics, maximum flow problem
16	Mei-Hwey Hou, Chienhua Chen	Service disciplines for guaranteed performance service.	RTCSA	1997	DBLP DOI BibTeX RDF	guaranteed performance service, packet service disciplines, traffic dynamics, fairness property, hierarchical packet fair queuing algorithm, packet switching, delay bounds, networking environment, service disciplines, end-to-end performance
16	Samit Chaudhuri, Stephen A. Blythe, Robert A. Walker 0001	An exact methodology for scheduling in a 3D design space.	ISSS	1995	DBLP DOI BibTeX RDF	2D design space, 3D design space, 3D scheduling problem, Voyager design space exploration system, candidate clock lengths, clock length, globally optimal solution, schedule length, three dimensional scheduling, three-dimensional design space, two dimensional design space, scheduling, optimisation, high level synthesis, search problems, clocks, tight bounds, network synthesis, search space pruning
16	David A. Cohn, Eve A. Riskin, Richard E. Ladner	Theory and Practice of Vector Quantizers Trained on Small Training Sets.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	small training sets, memoryless vector quantizer, training set distortion, test distortion, training image, formal bounds, vector quantizer codebooks, empirical simulations, image coding, statistics, learning systems, vector quantisation, Vapnik-Chervonenkis dimension
16	Jop F. Sibeyn, Michael Kaufmann 0001, Rajeev Raman	Randomized Routing on Meshes with Buses.	ESA	1993	DBLP DOI BibTeX RDF	algorithms, parallel computation, lower bounds, meshes, randomization, coloring, packet routing, buses
16	Valmir Carneiro 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
16	Eric Blais, Ryan O'Donnell	Lower Bounds for Testing Function Isomorphism.	CCC	2010	DBLP DOI BibTeX RDF	lower bounds, Boolean functions, property testing
16	Vivek Dua, Efstratios N. Pistikopoulos	Bounds and Solution Vector Estimates for Parametric NLPS.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Parametric upper and lower bounds, Sensitivity analysis, Linear approximation
16	Michael Navon, Alex Samorodnitsky	Linear Programming Bounds for Codes via a Covering Argument.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Linear programming bounds for codes, Discrete Fourier transform
16	Liming Yang, Laisheng Wang, Yitian Xu, Qun Sun	Time Series Prediction Based on Generalization Bounds for Support Vector Machine.	ISNN (2)	2009	DBLP DOI BibTeX RDF	VC bounds, SVM, Time series prediction, AR model
16	Keqiao Yang, Zeng Huang, Min Yang	Array Bounds Check Elimination for Java Based on Sparse Representation.	SERA	2009	DBLP DOI BibTeX RDF	array bounds check elimination, Java, optimization, performance