Search results for "bounds"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	W. Dale Brownawell, Chee-Keng Yap	Lower bounds for zero-dimensional projections.	ISSAC	2009	DBLP DOI BibTeX RDF	chow forms, exact numerical algorithms, nullstellensatz, transcendence theory, zero bounds, exact geometric computation
16	Nitin Saxena 0001	Diagonal Circuit Identity Testing and Lower Bounds.	ICALP (1)	2008	DBLP DOI BibTeX RDF	identity testing, depth 3, depth 4, lower bounds, determinant, arithmetic circuit, permanent
16	Maurice J. Jansen	Lower Bounds for Syntactically Multilinear Algebraic Branching Programs.	MFCS	2008	DBLP DOI BibTeX RDF	multilinear polynomials, algebraic branching programs, Computational complexity, lower bounds, arithmetical circuits
16	Andy Rupp, Gregor Leander, Endre Bangerter, Alexander W. Dent, Ahmad-Reza Sadeghi	Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems.	ASIACRYPT	2008	DBLP DOI BibTeX RDF	Generic Group Model, Hardness Conditions, Lower Bounds, Straight-Line Programs
16	Ran Raz, Amir Yehudayoff	Lower Bounds and Separations for Constant Depth Multilinear Circuits.	CCC	2008	DBLP DOI BibTeX RDF	Constant Depth, Lower Bounds, Separations, Arithmetic Circuits
16	Vicky Henderson, David Hobson, William Shaw, Rafal Wojakowski	Bounds for in-progress floating-strike Asian options using symmetry.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Asian options, Floating strike Asian options, Put call symmetry, Change of numéraire, Bounds
16	Ashutosh Sabharwal, Ahmad Khoshnevis, Edward W. Knightly	Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	capacity bounds, measurement overhead, opportunistic access, 802.11, CSMA/CA, multi-channel
16	Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee 0001, George C. Necula	Enforcing resource bounds via static verification of dynamic checks.	ACM Trans. Program. Lang. Syst.	2007	DBLP DOI BibTeX RDF	Resource bounds, dynamic, static
16	Wendelin L. F. Degen	Sharp error bounds for piecewise linear interpolation of planar curves.	Computing	2007	DBLP DOI BibTeX RDF	curvature, Error bounds, linear interpolation
16	Nicole Schweikardt	Machine models and lower bounds for query processing.	PODS	2007	DBLP DOI BibTeX RDF	machine models, XML, complexity, query processing, lower bounds, data streams, survey, external memory
16	Sylvain Perifel	Symmetry of Information and Nonuniform Lower Bounds.	CSR	2007	DBLP DOI BibTeX RDF	nonuniform lower bounds, resource-bounded Kolmogorov complexity, symmetry of information, computational complexity
16	Rajeev Motwani 0001, Assaf Naor, Rina Panigrahy	Lower bounds on locality sensitive hashing.	SCG	2006	DBLP DOI BibTeX RDF	lower bounds, nearest neighbor search, locality sensitive hashing
16	Dinakar Dhurjati, Vikram S. Adve	Backwards-compatible array bounds checking for C with very low overhead.	ICSE	2006	DBLP DOI BibTeX RDF	automatic pool allocation, compilers, programming languages, array bounds checking, region management
16	Nir Ailon, Bernard Chazelle	Lower bounds for linear degeneracy testing.	J. ACM	2005	DBLP DOI BibTeX RDF	linear decision trees, Computational geometry, lower bounds
16	Hettihe P. Dharmasena, Ramachandran Vaidyanathan	Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Multiple bus networks, binary tree algorithms, bus loading, interconnection networks, lower bounds
16	Ran Raz	Resolution lower bounds for the weak pigeonhole principle.	J. ACM	2004	DBLP DOI BibTeX RDF	P different than NP, computational complexity, Lower bounds, propositional logic, proof complexity
16	Nir Ailon, Bernard Chazelle	Lower bounds for linear degeneracy testing.	STOC	2004	DBLP DOI BibTeX RDF	linear decision trees, lower, computational geometry, bounds
16	Alejandro Murua	Upper Bounds for Error Rates of Linear Combinations of Classifiers.	IEEE Trans. Pattern Anal. Mach. Intell.	2002	DBLP DOI BibTeX RDF	Exponential bounds, weakly dependent classifiers, machine learning, classification trees
16	Matthias Krause 0001, Stefan Lucks	Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	$ textit{TC}^{0} $, lower bounds.¶ Subject classification. 68Q25, Pseudorandomness, 94A60, function generators
16	Frederic Green	A complex-number Fourier technique for lower bounds on the Mod-m degree.	Comput. Complex.	2000	DBLP DOI BibTeX RDF	modulo functions, lower bounds, Circuit complexity, Fourier methods
16	Dima Grigoriev, Alexander A. Razborov	Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Exponential lower bounds, Depth 3 arithmetic circuits, Finite fields
16	Rosario Gennaro, Luca Trevisan	Lower Bounds on the Efficiency of Generic Cryptographic Constructions.	FOCS	2000	DBLP DOI BibTeX RDF	generic cryptographic constructions, universal one-way hash functions, black-box access, Impagliazzo-Rudich model, cryptography, lower bounds, random number generation, file organisation, pseudo-random generators, one-way permutations
16	Peter Auer	Using Upper Confidence Bounds for Online Learning.	FOCS	2000	DBLP DOI BibTeX RDF	upper confidence bounds, exploitation decision, exploration decision, adversarial bandit problem, associative reinforcement learning, linear value functions, learning (artificial intelligence), statistical analysis, statistics, online learning, random processes, random process, uncertainty handling, uncertain information
16	Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee	Super-linear time-space tradeoff lower bounds for randomized computation.	FOCS	2000	DBLP DOI BibTeX RDF	super-linear time-space tradeoff lower bounds, deterministic RAM algorithms, deterministic Boolean branching programs, computational complexity, lower bound, probability, randomised algorithms, decision problems, branching program, time-space tradeoff, randomized computation
16	András Antos, Luc Devroye, László Györfi	Lower Bounds for Bayes Error Estimation.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	lower bounds, Discrimination, statistical pattern recognition, rates of convergence, nonparametric estimation, Bayes error
16	Lars Kruse, Eike Schmidt, Gerd Jochens, Wolfgang Nebel	Lower and upper bounds on the switching activity in scheduled data flow graphs.	ISLPED	1999	DBLP DOI BibTeX RDF	bounds estimation, high-level power estimation
16	Walter Krämer	A Priori Worst Case Error Bounds for Floating-Point Computations.	IEEE Trans. Computers	1998	DBLP DOI BibTeX RDF	Rigorous error bounds, table-lookup algorithms, elementary function algorithms, automation of error analysis
16	Ulf Grenander, Michael I. Miller, Anuj Srivastava	Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR.	IEEE Trans. Pattern Anal. Mach. Intell.	1998	DBLP DOI BibTeX RDF	Hilbert-Schmidt bounds, orthogonal groups, performance analysis, Pose estimation, Bayesian approach, ATR
16	Joe Kilian, Erez Petrank, Charles Rackoff	Lower Bounds for Zero Knowledge on the Internet.	FOCS	1998	DBLP DOI BibTeX RDF	Lower Bounds, Zero Knowledge, Asynchronous Protocols
16	Dima Grigoriev, Alexander A. Razborov	Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields.	FOCS	1998	DBLP DOI BibTeX RDF	depth 3 arithmetic circuits, exponential lower bounds, approximating by sparse polynomials
16	Nirmal R. Saxena, Edward J. McCluskey	Parallel Signatur Analysis Design with Bounds on Aliasing.	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF	aliasing probability bounds, parallel signature designs, multiple input signature registers (MISR), linear feedback shift registers, random testing, Signature analysis
16	Jeff Erickson 0001	Better Lower Bounds for Halfspace Emptiness.	FOCS	1996	DBLP DOI BibTeX RDF	halfspace emptiness, query region, computational complexity, lower bounds, points, polyhedron, facets, partitioning algorithms, hyperplanes, polylogarithmic factors
16	Noam Nisan, Avi Wigderson	Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version).	FOCS	1995	DBLP DOI BibTeX RDF	restricted classes, computational complexity, lower bounds, digital arithmetic, polynomials, logic circuits, arithmetic circuits, multivariate polynomials, complexity measure, minimisation of switching nets, partial derivatives
16	Amos Beimel, Anna Gál, Mike Paterson	Lower Bounds for Monotone Span Programs.	FOCS	1995	DBLP DOI BibTeX RDF	linear algebraic model, span programs, symmetric branching, formula size, cryptography, lower bounds, secret-sharing, programming theory, computation theory, monotone span programs
16	C. Greg Plaxton	Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines.	FOCS	1995	DBLP DOI BibTeX RDF	distributed selection game, fixed-connection machines, abstract communication game, hypercubic machine, computational complexity, lower bound, hypercube networks, tight bounds
16	Xiaotie Deng, Patrick W. Dymond	Efficient routing and message bounds for optimal parallel algorithms.	IPPS	1995	DBLP DOI BibTeX RDF	message bounds, round-robin message-delivery, routing, parallel algorithms, computational complexity, routing algorithm, network routing, interprocessor communication, optimal parallel algorithms, crossbar networks, h-relations
16	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
16	S. A. Ali, G. Robert Redinbo	Tight Lower Bounds on the Detection Probabilities of Single Faults at Internal Signal Lines in Combinational Circuits.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	tight lower bounds, internal signal lines, fault diagnosis, logic testing, combinational circuits, combinational circuits, random testing, detection probabilities, single faults
16	Qian-Ping Gu, Jun Gu	Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	average time bounds, mesh-connectedcomputer, wraparound connections, distancebound, indexing schemes, average time complexity, parallel algorithms, parallel algorithms, computational complexity, multiprocessor interconnection networks, sorting, sorting, communication complexity, queue size, parallel sorting algorithms
16	Anil Kamath, Rajeev Motwani 0001, Krishna V. Palem, Paul G. Spirakis	Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture	FOCS	1994	DBLP DOI BibTeX RDF	tail bounds, satisfiability threshold conjecture, random allocation, random 3-SAT formulas, randomized algorithms, upper bound, probabilistic analysis, structural property, occupancy
16	Dima Grigoriev, Nicolai N. Vorobjov Jr.	Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates	FOCS	1994	DBLP DOI BibTeX RDF	complexity lower bounds, computation trees, elementary transcendental function gates, membership, arithmetic operations, algebraic functions, transcendental functions, convex polyhedron
16	Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson	Nearly Tight Bounds for Wormhole Routing	FOCS	1994	DBLP DOI BibTeX RDF	nearly tight bounds, high probability, lower bound, trees, routing algorithm, wormhole routing, optimal algorithms, two-dimensional mesh, Butterfly networks, multidimensional meshes
16	Bernard Chazelle	A Spectral Approach to Lower Bounds	FOCS	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
16	Johan Håstad, Stasys Jukna, Pavel Pudlák	Top-Down Lower Bounds for Depth 3 Circuits	FOCS	1993	DBLP DOI BibTeX RDF	nonmonotone circuits, top-down lower bounds, depth 3 circuits, depth 3 AND-OR-NOT circuits, strong lower bound, top-down argument
16	Dan Halperin, Micha Sharir	Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment	FOCS	1993	DBLP DOI BibTeX RDF	single connected component, near-quadratic bounds, motion planning problem, polygonal environment, arbitrary k-sided polygonal robot, polygon, combinatorial complexity
16	Javed A. Aslam, Scott E. Decatur	General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Bounding	FOCS	1993	DBLP DOI BibTeX RDF	statistical query learning, hypothesis boosting, complexity, noise, PAC learning, general bounds
16	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
16	Chung Keung Poon	Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs	FOCS	1993	DBLP DOI BibTeX RDF	nondeterministic NO-JAG, graph connectivity problems, node-named JAGs, node-ordered JAGs, nondeterministic Turing machine, space bounds
16	Nirmal R. Saxena, Piero Franco, Edward J. McCluskey	Simple Bounds on Serial Signature Analysis Aliasing for Random Testing.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	serial signature analysis aliasing, signature polynomial, simple bounds, linear cellular automaton, intermediate signatures, computational complexity, logic testing, probability, integrated circuit testing, random testing, finite automata, aliasing probability, linear finite state machine
16	Eric Allender, Lane A. Hemachandra	Lower Bounds for the Low Hierarchy.	J. ACM	1992	DBLP DOI BibTeX RDF	low hierarchy, sparse sets, lower bounds
16	C. Greg Plaxton, Bjorn Poonen, Torsten Suel	Improved Lower Bounds for Shellsort	FOCS	1992	DBLP DOI BibTeX RDF	nonmonotone increment sequences, Shellsort, proof idea, lower bounds
16	Don Coppersmith, Baruch Schieber	Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)	FOCS	1992	DBLP DOI BibTeX RDF	monotone arithmetic computations, binary computation tree, alternating 5-3 trees, computational complexity, lower bounds, depth, tight bound, arithmetic expression
16	Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks	A Decomposition Theorem and Bounds for Randomized Server Problems	FOCS	1992	DBLP DOI BibTeX RDF	randomized server problems, k-server problem, arbitrary metric spaces, lower bound, motion-planning, bounds, competitive ratio, decomposition theorem
16	Gloria Kissin	Upper and Lower Bounds on Switching Energy in VLSI.	J. ACM	1991	DBLP DOI BibTeX RDF	1-switchable functions, AND function, CID VLSI circuit, OR functions, USM, circuit scheme, compare functions, parity function, switching energy, uniswitch, energy-efficient, embedding, energy consumption, layout, average-case analysis, addition, upper and lower bounds
16	David R. Karger, Daphne Koller, Steven J. Phillips	Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths	FOCS	1991	DBLP DOI BibTeX RDF	path-comparison-based algorithm, hidden paths algorithm, edge weights, lower bound, time bounds, weighted graphs, all-pairs shortest paths
16	Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jirí Sgall	Communication Complexity Towards Lower Bounds on Circuit Depth	FOCS	1991	DBLP DOI BibTeX RDF	almost optimal lower bound, circuit depth, circuit depth complexity, n-bit Boolean function, communication game characterization, universal composition relation, lower bounds
16	Amir M. Ben-Amram, Zvi Galil	Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	union-find problem, average case time, data structure problems, output variability, problem variability, unbounded integers, lower bounds, upper bound, RAMs, worst case time
16	Peter W. Shor	How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing	FOCS	1991	DBLP DOI BibTeX RDF	2-D strip packing problem, ball packing, average-case online bin packing, expected wasted space, lowest bound, stochastic rightward matching problem, half-infinite strip, online algorithm, tight bounds, rectangle packing
16	Anna Gál	Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates	FOCS	1991	DBLP DOI BibTeX RDF	block sensitivity, reliable Boolean circuits, noisy gates, fixed positive probability, complexity, lower bounds, Boolean function
16	Ding-Zhu Du, Frank K. Hwang	An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio	FOCS	1990	DBLP DOI BibTeX RDF	concave function, lower bounds, minimum spanning trees, polytope, function minimization, continuous functions, Steiner ratio, Steiner minimum trees, Euclidean plane
16	Roman Smolensky	On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates	FOCS	1990	DBLP DOI BibTeX RDF	weak circuit lower bounds, symmetric gates, interpolation, Boolean function, partial derivatives, analytic functions
16	Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas	Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	asymptotically tight bounds, random fault model, faulty arrays of processors, worst-case fault model, low-dimensional arrays, congestion embedding, route, sort, 3-D, systolic algorithms, knot theory, 2-D
16	Michael Kharitonov, Andrew V. Goldberg, Moti Yung	Lower Bounds for Pseudorandom Number Generators	FOCS	1989	DBLP DOI BibTeX RDF	machine-based complexity, lower bounds, pseudorandom number generators
16	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
16	Constantine D. Polychronopoulos, Utpal Banerjee	Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	vector machines, DO all and DO across loops, parallel Fortran programs, program speedup, speedup bounds, multiprocessors, program graphs
16	Shinji Nakamura, Gerald M. Masson	Lower Bounds on Crosspoints in Concentrators.	IEEE Trans. Computers	1982	DBLP DOI BibTeX RDF	crosspoint, interconnection networks, lower bounds, Capacity, concentrators
16	Nikhil Jain, Yogish Sabharwal	Optimal bucket algorithms for large MPI collectives on torus interconnects.	ICS	2010	DBLP DOI BibTeX RDF	communication, MPI, collective, torus network
16	Xiang-Yang Li 0001	Multicast capacity of wireless ad hoc networks.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	scheduling, optimization, multicast, broadcast, wireless ad hoc networks, capacity, unicast, VC-dimension
16	Alexandre Belloni, Robert M. Freund	A geometric analysis of Renegar's condition number, and its interplay with conic curvature.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C31, 52A20
16	Sumit Gulwani, Sagar Jain, Eric Koskinen	Control-flow refinement and progress invariants for bound analysis.	PLDI	2009	DBLP DOI BibTeX RDF	control-flow refinement, progress invariants, formal verification, program verification, termination, bound analysis
16	Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra	List decoding tensor products and interleaved codes.	STOC	2009	DBLP DOI BibTeX RDF	Johnson bound, generalized hamming weights, interleaved codes, linear transformations, list decoding, tensor products
16	Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton	Polynomials that Sign Represent Parity and Descartes' Rule of Signs.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	68Q17, Subject classification
16	Shahar Sarid, Amir Shapiro	Classifying the multi robot path finding problem into a quadratic competitive complexity class.	Ann. Math. Artif. Intell.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68Q25, 68T40, 11Y16, 93C85, 68Q17, 68Q15, 68W40, 68W15
16	Lukas Kroc, Ashish Sabharwal, Bart Selman	Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting.	CPAIOR	2008	DBLP DOI BibTeX RDF
16	Shetal Shah, Krithi Ramamritham	Handling Non-linear Polynomial Queries over Dynamic Data.	ICDE	2008	DBLP DOI BibTeX RDF
16	Ran Raz, Amir Yehudayoff	Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors.	FOCS	2008	DBLP DOI BibTeX RDF
16	Nikhil Bansal 0001, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko	Dynamic pricing for impatient bidders.	SODA	2007	DBLP BibTeX RDF
16	Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie 0002	Testing k-wise and almost k-wise independence.	STOC	2007	DBLP DOI BibTeX RDF	almost k-wise independence, hidden clique, property testing, Fourier analysis, k-wise independence
16	Fabrice Tercinet, Emmanuel Néron, Christophe Lenté	Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 90B35, 90C27
16	Kaustubh R. Joshi, William H. Sanders, Matti A. Hiltunen, Richard D. Schlichting	Automatic Recovery Using Bounded Partially Observable Markov Decision Processes.	DSN	2006	DBLP DOI BibTeX RDF
16	Sathish Gopalakrishnan, Marco Caccamo, Lui Sha	Switch Scheduling and Network Design for Real-Time Systems.	IEEE Real Time Technology and Applications Symposium	2006	DBLP DOI BibTeX RDF
16	Peng Wang 0004, Baowen Xu, Jianjiang Lu, Dazhou Kang, Jin Zhou	Mapping Ontology Relations: An Approach Based on Best Approximations.	APWeb	2006	DBLP DOI BibTeX RDF
16	Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe	Solution sets for DCOPs and graphical games.	AAMAS	2006	DBLP DOI BibTeX RDF	k-optimality, multiagent systems, constraint reasoning, DCOP
16	Steven P. Weber, Xiangying Yang, Jeffrey G. Andrews, Gustavo de Veciana	Transmission capacity of wireless ad hoc networks with outage constraints.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
16	S. T. Smith	Statistical resolution limits and the complexified Cramér-Rao bound.	IEEE Trans. Signal Process.	2005	DBLP DOI BibTeX RDF
16	Weiliang Li, Xiang Gao, Ying Zhu, Visvanathan Ramesh, Terrance E. Boult	On the Small Sample Performance of Boosted Classifiers.	CVPR (2)	2005	DBLP DOI BibTeX RDF
16	Shivani Agarwal 0001, Partha Niyogi	Stability and Generalization of Bipartite Ranking Algorithms.	COLT	2005	DBLP DOI BibTeX RDF
16	Dazhou Kang, Hanwu Chen, Baowen Xu, Jianjiang Lu, Keyue Li, William C. Chu	Approximate Information Retrieval for Heterogeneity Ontologies.	CW	2005	DBLP DOI BibTeX RDF
16	Eunice E. Santos	Optimal and Efficient Parallel Tridiagonal Solvers Using Direct Methods.	J. Supercomput.	2004	DBLP DOI BibTeX RDF	tridiagonal solvers, parallel algorithms, linear algebra, parallel complexity, direct methods, LogP model
16	Valentina Damerow, Christian Sohler	Extreme Points Under Random Noise.	ESA	2004	DBLP DOI BibTeX RDF
16	Josep Díaz, Maria J. Serna, Nicholas C. Wormald	Computation of the Bisection Width for Random d-Regular Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
16	Xiaohong Jiang 0001, Hong Shen 0001, Md. Mamun-ur-Rashid Khandker, Susumu Horiguchi	Blocking behaviors of crosstalk-free optical Banyan networks on vertical stacking.	IEEE/ACM Trans. Netw.	2003	DBLP DOI BibTeX RDF	vertical stacking, multistage interconnection networks (MINs), blocking probability, switching networks, banyan networks
16	Satyanarayana V. Lokam	Graph Complexity and Slice Functions.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
16	Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh 0001	The Quantum Complexity of Set Membership.	Algorithmica	2002	DBLP DOI BibTeX RDF
16	Tomohiro Yoneda, Tomoya Kitai, Chris J. Myers	Automatic Derivation of Timing Constraints by Failure Analysis.	CAV	2002	DBLP DOI BibTeX RDF	Trace theoretic verification, Timing constraints, Failure analysis, Timed circuits
16	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-efficient approximate Voronoi diagrams.	STOC	2002	DBLP DOI BibTeX RDF
16	Walter Krämer, Armin Bantle	Automatic Forward Error Analysis for Floating Point Algorithms.	Reliab. Comput.	2001	DBLP DOI BibTeX RDF
16	Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz	Distance labeling in graphs.	SODA	2001	DBLP BibTeX RDF
16	Rudra Dutta, George N. Rouskas	On optimal traffic grooming in WDM rings.	SIGMETRICS/Performance	2001	DBLP DOI BibTeX RDF
16	Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto	On the Space and Access Complexity of Computation DAGs.	WG	2000	DBLP DOI BibTeX RDF