Search results for "bounds"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	József Bíró, Zalán Heszberger, Mátyás Martinecz	A Family of Performance Bounds for QoS Measures in Packet-Based Networks.	NETWORKING	2004	DBLP DOI BibTeX RDF
16	Michela Farenzena, Alessandro Busti, Andrea Fusiello, Arrigo Benedetti	Rigorous Accuracy Bounds for Calibrated Stereo Reconstruction.	ICPR (4)	2004	DBLP DOI BibTeX RDF
16	Luciano Lenzini, Linda Martorini, Enzo Mingozzi, Giovanni Stea	A Methodology for Deriving Per-Flow End-to-End Delay Bounds in Sink-Tree DiffServ Domains with FIFO Multiplexing.	ISCIS	2004	DBLP DOI BibTeX RDF
16	Goichiro Hanaoka, Hideki Imai, Jörn Müller-Quade, Anderson C. A. Nascimento, Akira Otsuka, Andreas J. Winter 0002	Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions.	ACISP	2004	DBLP DOI BibTeX RDF
16	Luís G. Rueda	New Bounds and Approximations for the Error of Linear Classifiers.	CIARP	2004	DBLP DOI BibTeX RDF
16	António Leslie Bajuelos, Ana Paula Tomás, Fábio Marques	Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces.	ICCSA (3)	2004	DBLP DOI BibTeX RDF
16	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia	Linear FPT reductions and computational lower bounds.	STOC	2004	DBLP DOI BibTeX RDF	lower bound, complexity theory, NP-hard problems
16	Hartmut Klauck	Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds.	FSTTCS	2004	DBLP DOI BibTeX RDF
16	Takeshi Ogita, Shin'ichi Oishi, Yasunori Ushiro	Computation of Sharp Rigorous Componentwise Error Bounds for the Approximate Solutions of Systems of Linear Equations.	Reliab. Comput.	2003	DBLP DOI BibTeX RDF
16	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
16	Zion Cien Shen, Chris C. N. Chu	Bounds on the number of slicing, mosaic, and general floorplans.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
16	Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee	Time-space trade-off lower bounds for randomized computation of decision problems.	J. ACM	2003	DBLP DOI BibTeX RDF	element distinctness, Branching programs, quadratic forms, random-access machines
16	Saugata Basu	Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
16	Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi	Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.	FOCS	2003	DBLP DOI BibTeX RDF
16	Boaz Barak, Yehuda Lindell, Salil P. Vadhan	Lower Bounds for Non-Black-Box Zero Knowledge.	FOCS	2003	DBLP DOI BibTeX RDF
16	Lei Jia, Jun Yao, Renqing Pei	Using Loose and Tight Bounds to Mine Frequent Itemsets.	KES	2003	DBLP DOI BibTeX RDF
16	Eleftheria Athanasopoulou, Christoforos N. Hadjicostis	Upper and lower bounds on FSM switching activity.	ISCAS (5)	2003	DBLP DOI BibTeX RDF
16	Shahar Mendelson, Petra Philips	Random Subclass Bounds.	COLT	2003	DBLP DOI BibTeX RDF
16	T. S. Jayram, Subhash Khot, Ravi Kumar 0001, Yuval Rabani	Cell-probe lower bounds for the partial match problem.	STOC	2003	DBLP DOI BibTeX RDF
16	Avinash Jain, Pierre Moulin, Michael I. Miller, Kannan Ramchandran	Information-Theoretic Bounds on Target Recognition Performance Based on Degraded Image Data.	IEEE Trans. Pattern Anal. Mach. Intell.	2002	DBLP DOI BibTeX RDF	multisensor data fusion, Object recognition, data compression, performance metrics, imaging sensors, automatic target recognition
16	Nasser S. Fard, Indra Gunawan	Reliability Bounds for Large Multistage Interconnection Networks.	PARA	2002	DBLP DOI BibTeX RDF
16	Camil Demetrescu, Giuseppe F. Italiano	Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths.	ICALP	2002	DBLP DOI BibTeX RDF
16	Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Cherkassky	Motion Prediction Using VC-Generalization Bounds.	ICPR (1)	2002	DBLP DOI BibTeX RDF
16	Jun (Jim) Xu, Richard J. Lipton	On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.	SIGCOMM	2002	DBLP DOI BibTeX RDF	quality of service, computational complexity, decision tree, packet scheduling, delay bound
16	Micah Adler, Adi Rosén	Tight Bounds for the Performance of Longest-in-System on DAGs.	STACS	2002	DBLP DOI BibTeX RDF
16	G. William Walster, Eldon R. Hansen	Computing Interval Parameter Bounds from Fallible Measurements Using Overdetermined (Tall) Systems of Nonlinear Equations.	COCOS	2002	DBLP DOI BibTeX RDF
16	Olivier Bousquet, Vladimir Koltchinskii, Dmitriy Panchenko	Some Local Measures of Complexity of Convex Hulls and Generalization Bounds.	COLT	2002	DBLP DOI BibTeX RDF
16	Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai	Unconditionally Secure Key Insulated Cryptosystems: Models, Bounds and Constructions.	ICICS	2002	DBLP DOI BibTeX RDF
16	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. Very Large Scale Integr. Syst.	2001	DBLP DOI BibTeX RDF
16	Rolf Drechsler, Wolfgang Günther 0001, Fabio Somenzi	Using lower bounds during dynamic BDD minimization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2001	DBLP DOI BibTeX RDF
16	Saugata Basu	Different bounds on the different Betti numbers of semi-algebraic sets.	SCG	2001	DBLP DOI BibTeX RDF
16	Tomás Lang, Jean-Michel Muller	Bounds on Runs of Zeros and Ones for Algebraic Functions.	IEEE Symposium on Computer Arithmetic	2001	DBLP DOI BibTeX RDF
16	Leah Epstein, Rob van Stee	Lower Bounds for On-Line Single-Machine Scheduling.	MFCS	2001	DBLP DOI BibTeX RDF
16	Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel	Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.	WG	2001	DBLP DOI BibTeX RDF
16	Pedro Meseguer, Javier Larrosa, Martí Sánchez-Fibla	Lower Bounds for Non-binary Constraint Optimization Problems.	CP	2001	DBLP DOI BibTeX RDF
16	Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-Francois Puget	New Lower Bounds of Constraint Violations for Over-Constrained Problems.	CP	2001	DBLP DOI BibTeX RDF
16	Balázs Kégl, Tamás Linder, Gábor Lugosi	Data-Dependent Margin-Based Generalization Bounds for Classification.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF
16	Ran Raz, Amir Shpilka	Lower bounds for matrix product, in bounded depth circuits with arbitrary gates.	STOC	2001	DBLP DOI BibTeX RDF
16	Harry Buhrman, Ronald de Wolf	Communication Complexity Lower Bounds by Polynomials.	CCC	2001	DBLP DOI BibTeX RDF
16	Diana Marculescu, Radu Marculescu, Massoud Pedram	Theoretical bounds for switching activity analysis in finite-state machines.	IEEE Trans. Very Large Scale Integr. Syst.	2000	DBLP DOI BibTeX RDF
16	Eric Thiémard	Computing Bounds for the Star Discrepancy.	Computing	2000	DBLP DOI BibTeX RDF	AMS Subject Classifications: 11K38, 11Y16, 65D20
16	Pierre L. Douillet, André-Luc Beylot, Monique Becker	Computing Stochastical Bounds for the Tail Distribution of an M/GI/1 Queue.	NETWORKING	2000	DBLP DOI BibTeX RDF
16	Takayuki Nagai, Nobuki Tokura	Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates.	JCDCG	2000	DBLP DOI BibTeX RDF
16	Michael Schmitt 0001	VC Dimension Bounds for Product Unit Networks.	IJCNN (4)	2000	DBLP DOI BibTeX RDF
16	Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger	Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors.	ICPP	2000	DBLP DOI BibTeX RDF
16	László Babai, Anna Gál, Avi Wigderson	Superpolynomial Lower Bounds for Monotone Span Programs.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q05, 68R05, 05D05
16	Michael W. Beattie, Lawrence T. Pileggi	Error bounds for capacitance extraction via window techniques.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
16	Ting Chen, Ming-Yang Kao	On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees.	ESA	1999	DBLP DOI BibTeX RDF
16	András Antos	Lower Bounds on the Rate of Convergence of Nonparametric Pattern Recognition.	EuroCOLT	1999	DBLP DOI BibTeX RDF
16	John C. S. Lui, Richard R. Muntz, Donald F. Towsley	Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	performance modeling methodology, analysis of multiprocessing systems, performance evaluation, High performance computing
16	Valery N. Shevchenko, Nikolai Yu. Zolotykh	Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries.	ALT	1998	DBLP DOI BibTeX RDF
16	Marco Cadoli, Luigi Palopoli 0001, Francesco Scarcello	Propositional Lower Bounds: Generalization and Algorithms.	JELIA	1998	DBLP DOI BibTeX RDF
16	Wei-Ngan Chin, Masami Hagiya	A Bounds Inference Method for Vector-Based Memoisation.	ICFP	1997	DBLP DOI BibTeX RDF
16	Maria Luisa Bonet, Nicola Galesi	Linear Lower Bounds and Simulations in Frege Systems with Substitutions.	CSL	1997	DBLP DOI BibTeX RDF
16	Brian McGurk, Raymond Russell	Simple Bounds for Queues Fed by Markovian Sources: A Tool for Performance Evaluation.	Computer Performance Evaluation	1997	DBLP DOI BibTeX RDF
16	Michael W. Beattie, Lawrence T. Pileggi	Bounds for BEM Capacitance Extraction.	DAC	1997	DBLP DOI BibTeX RDF
16	Hadar I. Avi-Itzhak, Thanh A. Diep	Arbitrarily Tight Upper and Lower Bounds on the Bayesian Probability of Error.	IEEE Trans. Pattern Anal. Mach. Intell.	1996	DBLP DOI BibTeX RDF	probability of error, statistical pattern recognition, Bayesian decision
16	William Rucklidge	Lower Bounds for the Complexity of the Graph of the Hausdorff Distance as a Function of Transformation.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
16	Xian-Mo Zhang, Yuliang Zheng 0001	Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions.	EUROCRYPT	1996	DBLP DOI BibTeX RDF
16	Jack Brassil, Rene L. Cruz	Bounds on Maximum Delay in Networks with Deflection Routing.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	deflection networks, performance analysis, hypercube, livelock, shuffle-exchange, Hot-potato routing, Manhattan Street Network
16	Rwo-Hsi Wang, Aloysius K. Mok	Response-Time Bounds of EQL Rule-Based Programs Under Rule Priority Structure.	IEEE Trans. Software Eng.	1995	DBLP DOI BibTeX RDF	Real-time decision systems, algorithm, timing analysis, rule-based systems, priority
16	Michael Lindenbaum	Bounds on Shape Recognition Performance.	IEEE Trans. Pattern Anal. Mach. Intell.	1995	DBLP DOI BibTeX RDF	object similarity, performance evaluation, computer vision, localization, Recognition, probabilistic models
16	Kam Lee	Performance Bounds in Communication Networks with Variable-Rate Links.	SIGCOMM	1995	DBLP DOI BibTeX RDF
16	Sally A. McKee, William A. Wulf, Trevor C. Landon	Bounds on Memory Bandwidth in Streamed Computations.	Euro-Par	1995	DBLP DOI BibTeX RDF
16	Pavol Duris, José D. P. Rolim	Optimal Lower Bounds on the Multiparty Communication Complexity.	STACS	1995	DBLP DOI BibTeX RDF
16	Kamal Kumar Jain, V. Rajaraman	Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules.	IEEE Trans. Parallel Distributed 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
16	Rusins Freivalds, Marek Karpinski	Lower Space Bounds for Randomized Computation.	ICALP	1994	DBLP DOI BibTeX RDF
16	Pavel Pudlák	Unexpected Upper Bounds on the Complexity of Some Communication Games.	ICALP	1994	DBLP DOI BibTeX RDF
16	Jürgen Bierbrauer, K. Gopalakrishnan 0001, Douglas R. Stinson	Bounds for Resilient Functions and Orthogonal Arrays.	CRYPTO	1994	DBLP DOI BibTeX RDF
16	Farid M. Ablayev	Lower Bounds for One-way Probabilistic Communication Complexity.	ICALP	1993	DBLP DOI BibTeX RDF
16	Una-May O'Reilly, Nicola Santoro	The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence.	WG	1992	DBLP DOI BibTeX RDF
16	David M. Nicol	Performance Bounds on Parallel Self-Initiating Discrete-Event Simulations.	ACM Trans. Model. Comput. Simul.	1991	DBLP DOI BibTeX RDF	parallel simulation, synchronization protocol
16	Loic Pottier	Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms.	RTA	1991	DBLP DOI BibTeX RDF
16	Pak K. Chan, Martine D. F. Schlag	Bounds on signal delay in RC mesh networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
16	Mark Allen Weiss, Robert Sedgewick	Tight Lower Bounds for Shellsort.	SWAT	1988	DBLP DOI BibTeX RDF
16	Prasoon Tiwari	Lower bounds on communication complexity in distributed computer networks.	J. ACM	1987	DBLP DOI BibTeX RDF
16	Johan van Tilburg, Dick E. Boekee	Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis.	CRYPTO	1985	DBLP DOI BibTeX RDF
16	Susanne E. Hambrusch, Janos Simon	Lower Bounds for Solving Undirected Graph Problems on VLSI.	ICALP	1983	DBLP DOI BibTeX RDF
16	Harold Abelson	Lower Bounds on Information Transfer in Distributed Computations.	J. ACM	1980	DBLP DOI BibTeX RDF
16	Bruce A. Chartres, James C. Geuder	Computable Error Bounds for Direct Solution of Linear Equations.	J. ACM	1967	DBLP DOI BibTeX RDF
16	Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia	Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.	STACS	2005	DBLP DOI BibTeX RDF	Kernelization, parameterized complexity
16	Victor G. Krymsky	Computing Interval Bounds for Statistical Characteristics Under Expert-Provided Bounds on Probability Density Functions.	PARA	2004	DBLP DOI BibTeX RDF
13	Andris Ambainis, Robert Spalek, Ronald de Wolf	A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs.	Algorithmica	2009	DBLP DOI BibTeX RDF	Quantum lower bounds, Boolean functions, Quantum computing, Quantum algorithms, Time-space tradeoffs
13	Ran Raz	Multi-linear formulas for permanent and determinant are of super-polynomial size.	J. ACM	2009	DBLP DOI BibTeX RDF	arithmetic formulas, lower bounds, circuit complexity, algebraic complexity
13	Ruymán Cruz-Barroso, Pablo González-Vera, Francisco Perdomo-Pío	An application of Szego polynomials to the computation of certain weighted integrals on the real line.	Numer. Algorithms	2009	DBLP DOI BibTeX RDF	Gaussian quadrature formulas, Szeg? polynomials, Szeg? quadrature formulas, Interpolatory type quadrature formulas, Error bounds
13	Cherif R. Salama, Gregory Malecha, Walid Taha, Jim Grundy, John O'Leary	Static consistency checking for verilog wire interconnects: using dependent types to check the sanity of verilog descriptions.	PEPM	2009	DBLP DOI BibTeX RDF	static array bounds checking, verilog elaboration, verilog wire width consistency, dependent types, dead code elimination
13	Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Vassilvitskii, Martin Zinkevich	Adaptive bidding for display advertising.	WWW	2009	DBLP DOI BibTeX RDF	adaptive bidding, concentration bounds, display advertising, guaranteed delivery, guess-then-double algorithms
13	Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv	A combination framework for tracking partition sizes.	POPL	2009	DBLP DOI BibTeX RDF	combining analyses, set analysis, termination, shape analysis, numerical analysis, memory safety, space bounds
13	Peyman Afshani, Chris H. Hamilton, Norbert Zeh	Cache-oblivious range reporting with optimal queries requires superlinear space.	SCG	2009	DBLP DOI BibTeX RDF	data structures, lower bounds, memory hierarchies, range searching, cache-obliviousness
13	Andrea Vattani	k-means requires exponentially many iterations even in the plane.	SCG	2009	DBLP DOI BibTeX RDF	lower bounds, k-means
13	Andreas Haeberlen, Petr Kuznetsov	The Fault Detection Problem.	OPODIS	2009	DBLP DOI BibTeX RDF	fault detection problem, lower bounds, message complexity, Fault classes
13	Siddharth Garg, Diana Marculescu, Radu Marculescu, Ümit Y. Ogras	Technology-driven limits on DVFS controllability of multiple voltage-frequency island designs: a system-level perspective.	DAC	2009	DBLP DOI BibTeX RDF	Networks-on-Chip, power management, performance bounds
13	Clayton W. Commander, Panos M. Pardalos, Valeriy Ryabchenko, Oleg V. Shylo, Stan Uryasev, Grigoriy Zrazhevsky	Jamming communication networks under complete uncertainty.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Network interdiction, Network jamming, Optimization, Bounds
13	Daniele Micciancio, Saurabh Panjwani	Optimal communication complexity of generic multicast key distribution.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	nested encryption, security, multicast, lower bounds, secret sharing, key distribution
13	Yu-Feng Chien, Wing-Kai Hon, Rahul Shah 0001, Jeffrey Scott Vitter	Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing.	DCC	2008	DBLP DOI BibTeX RDF	Burrows-Wheeler, Lower Bounds, Pattern Matching, Range Searching
13	Sumit Gulwani, Saurabh Srivastava 0001, Ramarathnam Venkatesan	Program analysis as constraint solving.	PLDI	2008	DBLP DOI BibTeX RDF	most-general counterexamples, non-termination analysis, strongest postcondition, program verification, constraint solving, weakest precondition, bounds analysis
13	Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra	The Complexity of the Evolution of Graph Labelings.	SNPD	2008	DBLP DOI BibTeX RDF	flips, lower and upper bounds, complexity, mutations, Graph labeling
13	Zeev Dvir, Amir Shpilka, Amir Yehudayoff	Hardness-randomness tradeoffs for bounded depth arithmetic circuits.	STOC	2008	DBLP DOI BibTeX RDF	bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits
13	Rafail Ostrovsky, William E. Skeith III	Communication Complexity in Algebraic Two-Party Protocols.	CRYPTO	2008	DBLP DOI BibTeX RDF	fully homomorphic encryption, PIR writing, algebraic lower bounds, communication complexity, keyword search, private information retrieval, homomorphic encryption
13	Dorit S. Hochbaum	Complexity and algorithms for nonlinear optimization problems.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Convex network flow, Lower bounds on complexity, Nonlinear optimization, Strongly polynomial algorithms