Search results for "Bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
13	Myung-Kwang Byun, Daeyoung Park, Byeong Gi Lee	Performance and distance spectrum of space-time codes in fast rayleigh fading channels.	IEEE Trans. Commun.	2008	DBLP DOI BibTeX RDF
13	Guang-Hong Yang, Jiuxiang Dong	Control Synthesis of Singularly Perturbed Fuzzy Systems.	IEEE Trans. Fuzzy Syst.	2008	DBLP DOI BibTeX RDF
13	Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung Tang	Limits of Learning-Based Superresolution Algorithms.	Int. J. Comput. Vis.	2008	DBLP DOI BibTeX RDF	Learning-based, Resolution, Limits, Superresolution
13	Harold N. Gabow, Suzanne Gallagher	Iterated rounding algorithms for the smallest k-edge connected spanning subgraph.	SODA	2008	DBLP BibTeX RDF
13	Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen 0001, Robert Endre Tarjan	Faster Algorithms for Incremental Topological Ordering.	ICALP (1)	2008	DBLP DOI BibTeX RDF
13	Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth	Extremal problems on triangle areas in two and three dimensions.	SCG	2008	DBLP DOI BibTeX RDF	distinct triangle areas, extremal combinatorics, maximum triangle areas, minimum triangle areas, unit triangle areas, discrete geometry, point configurations
13	Holger Petersen 0001	Sorting and Element Distinctness on One-Way Turing Machines.	LATA	2008	DBLP DOI BibTeX RDF
13	Pinyan Lu, Changyuan Yu	Randomized Truthful Mechanisms for Scheduling Unrelated Machines.	WINE	2008	DBLP DOI BibTeX RDF
13	Yoram Moses, Michel Raynal	No Double Discount: Condition-Based Simultaneity Yields Limited Gain.	DISC	2008	DBLP DOI BibTeX RDF
13	Chao Tian 0002, Soheil Mohajer, Suhas N. Diggavi	On the Symmetric Gaussian Multiple Description Rate-Distortion Function.	DCC	2008	DBLP DOI BibTeX RDF	rate-distortion function, Multiple descriptions
13	Donghoon Chang, Mridul Nandi	Improved Indifferentiability Security Analysis of chopMD Hash Function.	FSE	2008	DBLP DOI BibTeX RDF
13	Rahul Jain 0001, Hartmut Klauck, Ashwin Nayak 0001	Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract.	STOC	2008	DBLP DOI BibTeX RDF	rectangle bounds, subdistribution bounds, information theory, communication complexity, direct product
13	Troy Lee, Adi Shraibman	Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.	CCC	2008	DBLP DOI BibTeX RDF	multiparty communication complexity, disjointness, lower bounds
13	William Yeoh 0001, Ariel Felner, Sven Koenig	IDB-ADOPT: A Depth-First Search DCOP Algorithm.	CSCLP	2008	DBLP DOI BibTeX RDF	Distributed Search Algorithms, ADOPT, Distributed Constraint Optimization, DCOP
13	Immanuel M. Bomze, Florian Frommlet, Martin Rubey	Improved SDP bounds for minimizing quadratic functions over the l1\ell^{1}-ball.	Optim. Lett.	2007	DBLP DOI BibTeX RDF
13	Adam R. Klivans, Alexander A. Sherstov	Unconditional lower bounds for learning intersections of halfspaces.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions
13	Xiaofu Wu, Haige Xiang, Cong Ling 0001	New Gallager Bounds in Block-Fading Channels.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
13	Sheng Yang 0001, Jean-Claude Belfiore	Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
13	Masoud Ebrahimi 0001, Mohammad Ali Maddah-Ali, Amir K. Khandani	Throughput Scaling Laws for Wireless Networks With Fading Channels.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
13	Rongheng Li, Huei Chuen Huang	List scheduling for jobs with arbitrary release times and similar lengths.	J. Sched.	2007	DBLP DOI BibTeX RDF	Makespan, Competitive ratio, List scheduling, On-line scheduling
13	Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung Tang	Limits of Learning-Based Superresolution Algorithms.	ICCV	2007	DBLP DOI BibTeX RDF
13	Jawwad Shamsi, Monica Brockmeyer	SyncProbe: Providing Assurance of Message Latency through Predictive Monitoring of Internet Paths.	HASE	2007	DBLP DOI BibTeX RDF
13	Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen	Width-Optimal Visibility Representations of Plane Graphs.	ISAAC	2007	DBLP DOI BibTeX RDF
13	Thomas Sauerwald	On Mixing and Edge Expansion Properties in Randomized Broadcasting.	ISAAC	2007	DBLP DOI BibTeX RDF
13	Chen Yu, Yasushi Inoguchi, Susumu Horiguchi	Overall Blocking Behavior Analysis on Banyan-Based Optical Switching Networks Under Crosstalk Constraint.	NPC	2007	DBLP DOI BibTeX RDF	vertical stacking optical banyan, degree of crosstalk, blocking probability, banyan networks, Optical switching networks
13	Ahuva Mu'alem, Michael Schapira	Setting lower bounds on truthfulness: extended abstract.	SODA	2007	DBLP BibTeX RDF
13	Jonathan A. Kelner, Evdokia Nikolova	On the Hardness and Smoothed Complexity of Quasi-Concave Minimization.	FOCS	2007	DBLP DOI BibTeX RDF
13	Markus Bläser, Andreas Meyer de Voltaire	Semisimple Algebras of Almost Minimal Rank over the Reals.	MFCS	2007	DBLP DOI BibTeX RDF
13	David Avis, Tsuyoshi Ito	Comparison of two bounds of the quantum correlation set.	ICQNM	2007	DBLP DOI BibTeX RDF
13	Venkatesan Guruswami, Atri Rudra	Better Binary List-Decodable Codes Via Multilevel Concatenation.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
13	James Demmel, Yozo Hida, William Kahan, Xiaoye S. Li, Sonil Mukherjee, E. Jason Riedy	Error bounds from extra-precise iterative refinement.	ACM Trans. Math. Softw.	2006	DBLP DOI BibTeX RDF	Linear algebra, floating-point arithmetic, BLAS, LAPACK
13	Jingyu Hu, Scott L. Miller	Performance analysis of convolutionally coded systems over quasi-static fading channels.	IEEE Trans. Wirel. Commun.	2006	DBLP DOI BibTeX RDF
13	Chen Yu, Xiaohong Jiang 0001, Susumu Horiguchi, Minyi Guo	Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	horizontal expansion, vertical stacking, blocking probability, banyan networks, Optical switching networks
13	Gerhard Kramer, Serap A. Savari	Edge-Cut Bounds on Network Coding Rates.	J. Netw. Syst. Manag.	2006	DBLP DOI BibTeX RDF	d-separation, network coding, active networks, Network capacity
13	Gil I. Shamir	On the MDL principle for i.i.d. sources with large alphabets.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
13	Zhangzhi Zhang, S. W. Cheung, T. I. Yuk, Hoi Kuo	Union Bounds for BER Evaluation and Code Optimization of Space-Time codes in 2-by-2 MIMO systems.	VTC Spring	2006	DBLP DOI BibTeX RDF
13	David Arthur, Sergei Vassilvitskii	Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method.	FOCS	2006	DBLP DOI BibTeX RDF
13	Qiqi Yan	Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique.	ICALP (2)	2006	DBLP DOI BibTeX RDF
13	Olivier Serre	Parity Games Played on Transition Graphs of One-Counter Processes.	FoSSaCS	2006	DBLP DOI BibTeX RDF
13	Jens Jägersküpper	Probabilistic runtime analysis of (1 +, lambda), ES using isotropic mutations.	GECCO	2006	DBLP DOI BibTeX RDF	sphere function, evolution strategies, runtime analysis
13	Adam R. Klivans, Alexander A. Sherstov	Improved Lower Bounds for Learning Intersections of Halfspaces.	COLT	2006	DBLP DOI BibTeX RDF
13	Burkhard Englert	Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform.	ISPA	2006	DBLP DOI BibTeX RDF
13	Margarita V. Korovina, Nicolai N. Vorobjov Jr.	Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems.	CiE	2006	DBLP DOI BibTeX RDF
13	Xiuzhen Huang, Jianer Chen	On PTAS for Planar Graph Problems.	IFIP TCS	2006	DBLP DOI BibTeX RDF
13	Konstantinos Panagiotou, Alexander Souza	On adequate performance measures for paging.	STOC	2006	DBLP DOI BibTeX RDF	paging problem, performance analysis, LRU
13	Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu	De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).	LATIN	2006	DBLP DOI BibTeX RDF
13	Niv Buchbinder, Joseph Naor	Fair online load balancing.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, load balancing, online algorithms, competitive analysis, greedy algorithm
13	Harry Buhrman, Troy Lee, Dieter van Melkebeek	Language compression and pseudorandom generators.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	Subject classification, 68P30
13	Leah Epstein, Rob van Stee	Online square and cube packing.	Acta Informatica	2005	DBLP DOI BibTeX RDF
13	Alexander Schrijver	New code upper bounds from the Terwilliger algebra and semidefinite programming.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
13	Huynh van Ngai, Michel Théra	Error bounds for convex differentiable inequality systems in Banach spaces.	Math. Program.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 49J52, 90C30, 90C31
13	S. T. Smith	Covariance, subspace, and intrinsic Cramér-Rao bounds.	IEEE Trans. Signal Process.	2005	DBLP DOI BibTeX RDF
13	Abraham Bachrach, Kevin C. Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah	Lower Bounds for Maximum Parsimony with Gene Order Data.	Comparative Genomics	2005	DBLP DOI BibTeX RDF
13	Kazuyuki Amano, Akira Maruoka	On the Complexity of Depth-2 Circuits with Threshold Gates.	MFCS	2005	DBLP DOI BibTeX RDF
13	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	On the Black-Box Complexity of Sperner's Lemma.	FCT	2005	DBLP DOI BibTeX RDF
13	Tien Dzung Nguyen, Sang Hyun Kim, Nam Chul Kim	An Automatic Body ROI Determination for 3D Visualization of a Fetal Ultrasound Volume.	KES (2)	2005	DBLP DOI BibTeX RDF	fetal ultrasound volume, significant local minimum, visualization, support vector machines, region-of-interest
13	Jan Poland	FPL Analysis for Adaptive Bandits.	SAGA	2005	DBLP DOI BibTeX RDF
13	Matti Kääriäinen	Generalization Error Bounds Using Unlabeled Data.	COLT	2005	DBLP DOI BibTeX RDF
13	Ashish Agarwal, P. R. Kumar 0001	Capacity bounds for ad hoc and hybrid wireless networks.	Comput. Commun. Rev.	2004	DBLP DOI BibTeX RDF	ad hoc networks, wireless networks, physical model, hybrid networks, transport capacity, throughput capacity, protocol model
13	Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden	How to Better Use Expert Advice.	Mach. Learn.	2004	DBLP DOI BibTeX RDF	online prediction, learning from expert advice, online learning
13	Randall A. Berry, Eytan H. Modiano	The role of switching in reducing the number of electronic ports in WDM networks.	IEEE J. Sel. Areas Commun.	2004	DBLP DOI BibTeX RDF
13	Costas Busch	Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
13	Antoine Valembois, Marc P. C. Fossorier	Sphere-packing bounds revisited for moderate block lengths.	IEEE Trans. Inf. Theory	2004	DBLP DOI BibTeX RDF
13	Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir	Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
13	Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller	Complexities for generalized models of self-assembly.	SODA	2004	DBLP BibTeX RDF
13	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Equivalence of local treewidth and linear local treewidth and its algorithmic applications.	SODA	2004	DBLP BibTeX RDF
13	Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi	Büchi Complementation Made Tighter.	ATVA	2004	DBLP DOI BibTeX RDF
13	Nele Dexters, Toon Calders	Theoretical Bounds on the Size of Condensed Representations.	KDID	2004	DBLP DOI BibTeX RDF
13	Hao Jiang 0010, Puliu Yan, Jian-guo Zhou, Li-jia Chen, Ming Wu	Multi-constrained Least Cost QoS Routing Algorithm.	ICT	2004	DBLP DOI BibTeX RDF
13	Harry Buhrman, Troy Lee, Dieter van Melkebeek	Language Compression and Pseudorandom Generators.	CCC	2004	DBLP DOI BibTeX RDF
13	Steven S. Seiden, Rob van Stee	New Bounds for Multidimensional Packing.	Algorithmica	2003	DBLP DOI BibTeX RDF	Box packing, Approximation algorithms, Online algorithms, Bin packing
13	Saugata Basu	The Combinatorial and Topological Complexity of a Single Cell.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
13	Tolga Tasdizen, Ross T. Whitaker	Cramer-Rao Bounds for Nonparametric Surface Reconstruction from Range Data.	3DIM	2003	DBLP DOI BibTeX RDF
13	Pallab Dasgupta, P. P. Chakrabarti 0001, Arnab Dey, Sujoy Ghose, Wolfgang Bibel	Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	logic programming, heuristic search, constraint optimization
13	Steven S. Seiden, Rob van Stee	New bounds for multi-dimensional packing.	SODA	2002	DBLP BibTeX RDF
13	Vladlen Koltun, Micha Sharir	On the overlay of envelopes in four dimensions.	SODA	2002	DBLP BibTeX RDF
13	Yaoyun Shi	Quantum Lower Bounds for the Collision and the Element Distinctness Problems.	FOCS	2002	DBLP DOI BibTeX RDF
13	Partha Dutta, Rachid Guerraoui	The inherent price of indulgence.	PODC	2002	DBLP DOI BibTeX RDF
13	Ke Yang 0005	New Lower Bounds for Statistical Query Learning.	COLT	2002	DBLP DOI BibTeX RDF
13	Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh	Fast block matching algorithm based on the winner-update strategy.	IEEE Trans. Image Process.	2001	DBLP DOI BibTeX RDF
13	Yunhong Zhou, Subhash Suri	Shape sensitive geometric permutations.	SODA	2001	DBLP BibTeX RDF
13	Yossi Azar, Leah Epstein	On-Line Scheduling with Precedence Constraints.	SWAT	2000	DBLP DOI BibTeX RDF
13	Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger	Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors.	ICPP	2000	DBLP DOI BibTeX RDF
13	Ran Raz, Pierre McKenzie	Separation of the Monotone NC Hierarchy.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q15, 68R99, 68Q25
13	Van H. Vu	Extremal Set Systems with Weakly Restricted Intersections.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05D05, 05B20
13	Yau-Tsun Steven Li, Sharad Malik, Andrew Wolfe	Performance estimation of embedded software with instruction cache modeling.	ACM Trans. Design Autom. Electr. Syst.	1999	DBLP DOI BibTeX RDF
13	Hiroshi Nagamochi, Toshihide Ibaraki	A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.	IPCO	1999	DBLP DOI BibTeX RDF
13	Ashwin Nayak 0001	Optimal Lower Bounds for Quantum Automata and Random Access Codes.	FOCS	1999	DBLP DOI BibTeX RDF
13	K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal	Lower Bounds for Group Covering Designs.	AAECC	1999	DBLP DOI BibTeX RDF
13	Sebastian Cwilich, Mei Deng, David F. Lynch, S. J. Philips, Jeffery R. Westbrook	Algorithms for Restoration Planning in a Telecommunications Network.	ALENEX	1999	DBLP DOI BibTeX RDF
13	David Fernández-Baca, Timo Seppäläinen, Giora Slutzki	Bounds for Parametric Sequence Comparison.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF	global alignments, parametric computing, sensitivity analysis, computational biology, Sequence comparison
13	Sanjay Jain 0001, Arun Sharma 0001	Mind Change Complexity of Learning Logic Programs.	EuroCOLT	1999	DBLP DOI BibTeX RDF
13	Chuan-Yu Wang, Kaushik Roy 0001	Maximum power estimation for CMOS circuits using deterministic and statistical approaches.	IEEE Trans. Very Large Scale Integr. Syst.	1998	DBLP DOI BibTeX RDF
13	Koji Nakano, Stephan Olariu	An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Monotone matrices, totally monotone matrices, row minima, basic reconfigurable meshes, cellular system design, VLSI design, search problems, reconfigurable meshes, facility location problems
13	Lars Lundberg, Håkan Lennerstad	Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Parallel program scheduling, optimal performance bounds, multiprocessors with clusters, synchronizing processes, information from previous executions
13	Hisao Tamaki, Takeshi Tokuyama	How to Cut Pseudoparabolas into Segments.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
13	Hélène Touzet	Encoding the Hydra Battle as a Rewrite System.	MFCS	1998	DBLP DOI BibTeX RDF
13	Markus Röttger, Ulf-Peter Schroeder	Efficient Embeddings of Grids into Grids.	WG	1998	DBLP DOI BibTeX RDF
13	Ahmed El-Amawy, Priyalal Kulasinghe	Properties of Generalized Branch and Combine Clock Networks.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
13	Nabil Kahalé	Eigenvalues and Expansion of Regular Graphs.	J. ACM	1995	DBLP DOI BibTeX RDF	induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs