Search results for "tight bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	György Dósa	The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9.	ESCAPE	2007	DBLP DOI BibTeX RDF	first fit decreasing, tight bound
2	Xi Chen, Shang-Hua Teng	Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation.	FOCS	2007	DBLP DOI BibTeX RDF
2	Cao An Wang, Bo-Ting Yang	A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.	WADS	1999	DBLP DOI BibTeX RDF
2	Haruhisa Takahashi, Hanzhong Gu	A tight bound on concept learning.	IEEE Transactions on Neural Networks	1998	DBLP DOI BibTeX RDF
2	S. Q. Zheng, Balaji Calidas, Yanjun Zhang	Efficient in-place sorting algorithms using feasible parallel machine models.	ISPAN	1996	DBLP DOI BibTeX RDF	in-place sorting algorithms, feasible parallel machine models, parallel sorting scheme, ZZ-sort, average performance, MasPar parallel computer, distributed memory parallel computer system, standard routine, space critical situations, fixed-size reconfigurable meshes, parallel algorithms, sorting, reconfigurable architectures, distributed memory systems, safety-critical software, tight bound, worst case performance, parallel sorting algorithm
2	Yau-Tsun Steven Li, Sharad Malik, Andrew Wolfe	Cache modeling for real-time software: beyond direct mapped instruction caches. (PDF / PS)	IEEE Real-Time Systems Symposium	1996	DBLP DOI BibTeX RDF	direct mapped instruction caches, worst case timing analysis, cache hits, set associative instruction caches, unified caches, cinderella, research, integer-linear-programming, worst case execution time, data caches, cache storage, design tool, memory performance, cache misses, real-time software, tight bound, cache modeling, hardware system
1	Yijie Han	Tight bound for matching.	J. Comb. Optim.	2012	DBLP DOI BibTeX RDF
1	Iksoon Hwang, Nina Yevtushenko, Ana R. Cavalli	Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
1	Nina Amenta, Dominique Attali, Olivier Devillers	A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron.	Discrete & Computational Geometry	2012	DBLP DOI BibTeX RDF
1	Robert John Durrant, Ata Kabán	A tight bound on the performance of Fisher's linear discriminant in randomly projected data spaces.	Pattern Recognition Letters	2012	DBLP DOI BibTeX RDF
1	Sang Won Bae	Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments.	WALCOM	2012	DBLP DOI BibTeX RDF
1	Mehrnoush Malekesmaeili, Cedric Chauve, Tamon Stephen	A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix	CoRR	2011	DBLP BibTeX RDF
1	Junji Shikata, Daisuke Yamanaka	Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction.	IMA Int. Conf.	2011	DBLP DOI BibTeX RDF
1	Ge Xia, Liang Zhang	Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations.	CCCG	2011	DBLP BibTeX RDF
1	Evangelos Kranakis, Danny Krizanc, Pat Morin, Lata Narayanan, Ladislav Stacho	A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model	CoRR	2010	DBLP BibTeX RDF
1	Marius Kleiner, Bixio Rimoldi	A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme	CoRR	2010	DBLP BibTeX RDF
1	Ioannis K. Paparrizos	A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm	CoRR	2010	DBLP BibTeX RDF
1	An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao	A tight bound on the min-ratio edge-partitioning problem of a tree.	Discrete Applied Mathematics	2010	DBLP DOI BibTeX RDF
1	Satoshi Fujita	A tight bound on the number of mobile servers to guarantee transferability among dominating configurations.	Discrete Applied Mathematics	2010	DBLP DOI BibTeX RDF
1	Marius Kleiner, Bixio Rimoldi	A tight bound on the performance of a minimal-delay joint source-channel coding scheme.	ISIT	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton	Basic network creation games.	SPAA	2010	DBLP DOI BibTeX RDF	routing, nash equilibrium, network design, price of anarchy
1	Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel	Balls into bins with related random choices.	SPAA	2010	DBLP DOI BibTeX RDF	balls into bins, peer-to-peer
1	Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam Smith, Jonathan Ullman	The price of privately releasing contingency tables and the spectra of random matrices with correlated rows.	STOC	2010	DBLP DOI BibTeX RDF	reconstruction attacks, data privacy, differential privacy, random matrices
1	Gregory B. Sorkin, Angelika Steger, Rico Zenklusen	A tight bound on the collection of edges in MSTs of induced subgraphs.	J. Comb. Theory, Ser. B	2009	DBLP DOI BibTeX RDF
1	Saugata Basu, Richard Pollack, Marie-Françoise Roy	An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions.	Combinatorica	2009	DBLP DOI BibTeX RDF
1	Yijie Han	Tight Bound for Matching.	FCS	2009	DBLP BibTeX RDF
1	Valentin E. Brimkov	On the Convex Hull of the Integer Points in a Bi-circular Region.	IWCIA	2009	DBLP DOI BibTeX RDF	strictly convex set, facet complexity, upper/lower/tight bound, convex hull, convex polygon
1	Georgios Chalkiadakis, Edith Elkind, Maria Polukarov, Nicholas R. Jennings	The price of democracy in coalition formation.	AAMAS	2009	DBLP DOI BibTeX RDF	multilateral bargaining, game theory, coalition formation
1	Emilio Wuerges, Luiz C. V. dos Santos, Olinto J. V. Furtado, Sandro Rigo	An early real-time checker for retargetable compile-time analysis.	SBCCI	2009	DBLP DOI BibTeX RDF	compile-time WCET analysis, time-constraint feasibility analysis
1	Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman	On the price of mediation.	ACM Conference on Electronic Commerce	2009	DBLP DOI BibTeX RDF	game theory, correlation, mediation, equilibrium
1	Haim Kaplan, Natan Rubin, Micha Sharir	Line transversals of convex polyhedra in R3.	SODA	2009	DBLP DOI BibTeX RDF
1	Aless Lasaruk, Thomas Sturm	Effective Quantifier Elimination for Presburger Arithmetic with Infinity.	CASC	2009	DBLP DOI BibTeX RDF
1	Jihuan Ding, Guochuan Zhang	A Note on Online Scheduling for Jobs with Arbitrary Release Times.	COCOA	2009	DBLP DOI BibTeX RDF	Identical parallel machines, Makespan, Competitive ratio, On-line scheduling
1	Jorge Almeida, Benjamin Steinberg	Matrix Mortality and the Cerný-Pin Conjecture.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
1	Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad	On the Complexity of Deciding Avoidability of Sets of Partial Words.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
1	György Dósa, Leah Epstein	Preemptive Online Scheduling with Reordering.	ESA	2009	DBLP DOI BibTeX RDF
1	Huaming Zhang	On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs.	FAW	2009	DBLP DOI BibTeX RDF
1	Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers	Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos	Online Priority Steiner Tree Problems.	WADS	2009	DBLP DOI BibTeX RDF
1	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg	Labeling Schemes for Tree Representation.	Algorithmica	2009	DBLP DOI BibTeX RDF	Spanning tree, Labeling scheme, Tree representation
1	Vladlen Koltun, Micha Sharir	On Overlays and Minimization Diagrams.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Minimization diagrams, Overlays, Arrangements, Combinatorial complexity, Lower envelopes
1	Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe	A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches.	IEICE Transactions	2008	DBLP DOI BibTeX RDF
1	Stefan Dziembowski, Ueli M. Maurer	The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos	A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.	ESA	2008	DBLP DOI BibTeX RDF
1	Karl Schnaitter, Neoklis Polyzotis	Evaluating rank joins with optimal cost.	PODS	2008	DBLP DOI BibTeX RDF	feasible-region bound, pbrj, rank join, ranking query optimization, tight bound
1	Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum	Bit complexity of breaking and achieving symmetry in chains and rings.	J. ACM	2008	DBLP DOI BibTeX RDF	bit complexity, processor chain, processor ring, symmetric synchronous execution, Distributed computing, lower bounds, consensus, communication complexity, leader election, communication cost, message complexity, tight bound
1	Rachid Guerraoui, Michal Kapalka	On the correctness of transactional memory.	PPOPP	2008	DBLP DOI BibTeX RDF	model, lower bound, transactional memory, correctness
1	Jakob Nordström, Johan Håstad	Towards an optimal separation of space and length in resolution.	STOC	2008	DBLP DOI BibTeX RDF	length, lower bound, resolution, space, separation, pebbling, proof complexity
1	Habibul Islam, Ying-Chang Liang, Anh Tuan Hoang	Combining Eigen-Beamforming and Orthogonal Space-Time Block Coding for Secondary Usage of Spectrum.	ICC	2008	DBLP DOI BibTeX RDF
1	Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garcia-Luna-Aceves	Broadcast throughput Capacity of Wireless Ad Hoc Networks with Multipacket Reception.	ICC	2008	DBLP DOI BibTeX RDF
1	Zheng Wang, Hamid R. Sadjadpour, J. J. Garcia-Luna-Aceves	A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
1	Juan A. Colmenares, Chansik Im, K. H. (Kane) Kim, Raymond Klefstad, Chae-Deok Lim	Measurement Techniques in a Hybrid Approach for Deriving Tight Execution-time Bounds of Program Segments in Fully-featured Processors.	IEEE Real-Time and Embedded Technology and Applications Symposium	2008	DBLP DOI BibTeX RDF
1	Nghi H. Tran, Ha H. Nguyen, Tho Le-Ngoc	BICM-ID with signal space diversity over cascaded rayleigh fading channels [transactions letters].	IEEE Transactions on Communications	2008	DBLP DOI BibTeX RDF
1	Sander Stuijk, Marc Geilen, Twan Basten	Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs.	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF
1	Timothy Bretl, Sanjay Lall	Testing Static Equilibrium for Legged Robots.	IEEE Transactions on Robotics	2008	DBLP DOI BibTeX RDF
1	Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan	Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.	ACISP	2008	DBLP DOI BibTeX RDF	Information Theoretic Security, Mobile Adversary
1	Xi Chen, Xiaoming Sun, Shang-Hua Teng	Quantum Separation of Local Search and Fixed Point Computation.	COCOON	2008	DBLP DOI BibTeX RDF
1	Alexandru O. Balan, Michael J. Black	The Naked Truth: Estimating Body Shape Under Clothing.	ECCV	2008	DBLP DOI BibTeX RDF
1	Alberto Bertoni, Christian Choffrut, Roberto Radicioni	Literal Shuffle of Compressed Words.	IFIP TCS	2008	DBLP DOI BibTeX RDF
1	Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks	A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.	DISC	2008	DBLP DOI BibTeX RDF
1	Yiwei Jiang	Online scheduling on parallel machines with two GoS levels.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Online algorithm, Competitive analysis, Parallel machine scheduling, Grade of Service
1	Yuli Ye, Allan Borodin	Priority algorithms for the subset-sum problem.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Revocable acceptance, Approximation algorithm, Greedy, Subset-sum, Priority algorithm
1	Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou	A tight bound for online colouring of disk graphs.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Syed Amjad Ali, Nirmal Singh Kambo, Erhan AliRiza Ince	Exact expression and tight bound on pairwise error probability for performance analysis of turbo codes over nakagami-m fading channels.	IEEE Communications Letters	2007	DBLP DOI BibTeX RDF
1	Xi Chen, Shang-Hua Teng	Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation	CoRR	2007	DBLP BibTeX RDF
1	Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe	A tight bound on online buffer management for two-port shared-memory switches.	SPAA	2007	DBLP DOI BibTeX RDF	shared memory switches, competitive analysis, buffer management
1	Esther Ezra, Micha Sharir	Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions.	FOCS	2007	DBLP DOI BibTeX RDF
1	Jean-Marie Gorce, Ruifeng Zhang, Hervé Parvery	Tight Bound for the Mean Node Degree in Ad Hoc Networks with opportunistic Communications.	WiMob	2007	DBLP DOI BibTeX RDF
1	Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman	Single source multiroute flows and cuts on uniform capacity networks.	SODA	2007	DBLP DOI BibTeX RDF
1	Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs	Speed scaling to manage energy and temperature.	J. ACM	2007	DBLP DOI BibTeX RDF	power management, voltage scaling, Speed scaling
1	Benjamin Doerr, Edda Happ, Christian Klein	A tight analysis of the (1 + 1)-EA for the single source shortest path problem.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
1	Myung Ah Park, Andras Farago	Minimum Frequencies for the Virtual Maximum MAC Capacity in a Multichannel Ad-Hoc Network.	LCN	2007	DBLP DOI BibTeX RDF
1	Arno Moonen, Marco Bekooij, Rene van den Berg, Jef L. van Meerbergen	Practical and Accurate Throughput Analysis with the Cyclo Static Dataflow Model.	MASCOTS	2007	DBLP DOI BibTeX RDF
1	Kai-Uwe Schmidt	Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
1	Nghi H. Tran, Ha H. Nguyen, Tho Le-Ngoc	Multidimensional Subcarrier Mapping for Bit-Interleaved Coded OFDM With Iterative Decoding.	IEEE Transactions on Signal Processing	2007	DBLP DOI BibTeX RDF
1	Nghi H. Tran, Ha H. Nguyen, Tho Le-Ngoc	Bit-Interleaved Coded OFDM With Signal Space Diversity: Subcarrier Grouping and Rotation Matrix Design.	IEEE Transactions on Signal Processing	2007	DBLP DOI BibTeX RDF
1	ChenGuang Liu, Kazuyuki Tanaka	The Complexity of Algorithms Computing Game Trees on Random Assignments.	AAIM	2007	DBLP DOI BibTeX RDF
1	Yuli Ye, Allan Borodin	Priority Algorithms for the Subset-Sum Problem.	COCOON	2007	DBLP DOI BibTeX RDF
1	René Beier, Heiko Röglin, Berthold Vöcking	The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.	IPCO	2007	DBLP DOI BibTeX RDF
1	Stephane Durocher, Christophe Paul	Kinetic Maintenance of Mobile k-Centres on Trees.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Thomas Sauerwald	On Mixing and Edge Expansion Properties in Randomized Broadcasting.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller	Monadic Fragments of Gödel Logics: Decidability and Undecidability Results.	LPAR	2007	DBLP DOI BibTeX RDF
1	Mila Nikolova	Bounds on the Minimizers of (nonconvex) Regularized Least-Squares.	SSVM	2007	DBLP DOI BibTeX RDF	???? norm, non-convex analysis, non-smooth analysis, regularization, inverse problems, restoration, variational methods, bounds, edge preservation
1	Yefim Dinitz, Shay Solomon	On Optimal Solutions for the Bottleneck Tower of Hanoi Problem.	SOFSEM	2007	DBLP DOI BibTeX RDF
1	Sylvain Lombardy	On the Size of the Universal Automaton of a Regular Language.	STACS	2007	DBLP DOI BibTeX RDF	Universal Automaton, NFA Minimization, Regular languages
1	Jérémie Chalopin, Shantanu Das, Nicola Santoro	Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links.	DISC	2007	DBLP DOI BibTeX RDF
1	Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Calvin C. Newport	Gossiping in a Multi-channel Radio Network.	DISC	2007	DBLP DOI BibTeX RDF
1	Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks	Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks.	DISC	2007	DBLP DOI BibTeX RDF
1	Danny Kuminov, Moshe Tennenholtz	Competitive Safety Strategies in Position Auctions.	WINE	2007	DBLP DOI BibTeX RDF
1	Rongheng Li, Huei Chuen Huang	List scheduling for jobs with arbitrary release times and similar lengths.	J. Scheduling	2007	DBLP DOI BibTeX RDF	Makespan, Competitive ratio, List scheduling, On-line scheduling
1	Sheng-Hsiung Chen, Ting-Lu Huang	A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model.	J. Parallel Distrib. Comput.	2006	DBLP DOI BibTeX RDF
1	Saugata Basu, Richard Pollack, Marie-Françoise Roy	An asymptotically tight bound on the number of connected components of realizable sign conditions	CoRR	2006	DBLP BibTeX RDF
1	Stefano Aguzzoli	An asymptotically tight bound on countermodels for Lukasiewicz logic.	Int. J. Approx. Reasoning	2006	DBLP DOI BibTeX RDF
1	Krzysztof Pietrzak	A Tight Bound for EMAC.	ICALP	2006	DBLP DOI BibTeX RDF
1	Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas	The predicates for the Voronoi diagram of ellipses.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	Voronoi diagram, predicate, Euclidean distance, bisector, exact computation, ellipse, parametric representation
1	Vladlen Koltun, Micha Sharir	On overlays and minimization diagrams.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	minimization diagrams, Voronoi diagrams, overlays, arrangements, hyperplanes, power diagrams, lower envelopes
1	Renato M. de Moraes, Hamid R. Sadjadpour, J. J. Garcia-Luna-Aceves	Capacity of MIMO MANETs with cooperation.	IWCMC	2006	DBLP DOI BibTeX RDF	ad hoc networks, MIMO systems
1	Mohsin Iftikhar, Björn Landfeldt, Mine Çaglar	An analytical model based on G/M/1 with self-similar input to provide end-to-end QoS in 3G networks.	MOBIWAC	2006	DBLP DOI BibTeX RDF	GGSN, QoS, UMTS, self-similar, 3G
1	Florent de Dinechin, Christoph Quirin Lauter, Guillaume Melquiond	Assisted verification of elementary functions using Gappa.	SAC	2006	DBLP DOI BibTeX RDF
1	Arnab Chakrabarti, Ashutosh Sabharwal, Behnaam Aazhang	Communication power optimization in a sensor network with a path-constrained mobile observer.	TOSN	2006	DBLP DOI BibTeX RDF	Sensor network, communication, mobility, power, queuing